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/Problem17_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:33:15,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:33:15,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:33:15,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:33:15,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:33:15,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:33:15,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:33:15,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:33:15,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:33:15,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:33:15,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:33:15,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:33:15,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:33:15,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:33:15,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:33:15,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:33:15,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:33:15,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:33:15,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:33:15,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:33:15,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:33:15,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:33:15,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:33:15,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:33:15,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:33:15,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:33:15,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:33:15,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:33:15,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:33:15,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:33:15,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:33:15,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:33:15,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:33:15,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:33:15,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:33:15,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:33:15,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:33:15,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:33:15,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:33:15,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:33:15,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:33:15,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:33:15,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:33:15,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:33:15,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:33:15,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:33:15,493 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:33:15,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:33:15,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:33:15,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:33:15,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:33:15,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:33:15,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:33:15,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:33:15,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:33:15,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:33:15,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:33:15,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:33:15,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:33:15,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:33:15,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:33:15,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:33:15,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:33:15,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:33:15,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:33:15,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:33:15,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:33:15,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:33:15,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:33:15,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:33:15,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:33:15,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:33:15,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:33:15,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:33:15,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:33:15,549 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:33:15,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label14.c [2019-09-07 21:33:15,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8de4e5/9b8c8baa7ba644a3b61c85a9d3619cae/FLAG551482f65 [2019-09-07 21:33:16,306 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:33:16,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label14.c [2019-09-07 21:33:16,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8de4e5/9b8c8baa7ba644a3b61c85a9d3619cae/FLAG551482f65 [2019-09-07 21:33:16,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8de4e5/9b8c8baa7ba644a3b61c85a9d3619cae [2019-09-07 21:33:16,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:33:16,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:33:16,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:33:16,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:33:16,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:33:16,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:33:16" (1/1) ... [2019-09-07 21:33:16,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335c662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:16, skipping insertion in model container [2019-09-07 21:33:16,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:33:16" (1/1) ... [2019-09-07 21:33:16,453 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:33:16,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:33:17,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:33:17,639 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:33:18,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:33:18,111 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:33:18,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18 WrapperNode [2019-09-07 21:33:18,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:33:18,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:33:18,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:33:18,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:33:18,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... [2019-09-07 21:33:18,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:33:18,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:33:18,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:33:18,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:33:18,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:33:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:33:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:33:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:33:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:33:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:33:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:33:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:33:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:33:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:33:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:33:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:33:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:33:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:33:22,870 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:33:22,871 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:33:22,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:33:22 BoogieIcfgContainer [2019-09-07 21:33:22,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:33:22,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:33:22,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:33:22,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:33:22,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:33:16" (1/3) ... [2019-09-07 21:33:22,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104bf4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:33:22, skipping insertion in model container [2019-09-07 21:33:22,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:33:18" (2/3) ... [2019-09-07 21:33:22,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104bf4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:33:22, skipping insertion in model container [2019-09-07 21:33:22,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:33:22" (3/3) ... [2019-09-07 21:33:22,898 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label14.c [2019-09-07 21:33:22,909 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:33:22,922 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:33:22,945 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:33:22,998 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:33:22,998 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:33:22,999 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:33:22,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:33:22,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:33:22,999 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:33:22,999 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:33:22,999 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:33:22,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:33:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:33:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 21:33:23,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:23,056 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:33:23,058 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 816396385, now seen corresponding path program 1 times [2019-09-07 21:33:23,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:23,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:23,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:33:23,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:33:23,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:33:23,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:33:23,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:33:23,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:33:23,471 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:33:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:33:29,770 INFO L93 Difference]: Finished difference Result 2158 states and 4003 transitions. [2019-09-07 21:33:29,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:33:29,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-09-07 21:33:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:33:29,806 INFO L225 Difference]: With dead ends: 2158 [2019-09-07 21:33:29,806 INFO L226 Difference]: Without dead ends: 1474 [2019-09-07 21:33:29,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:33:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-07 21:33:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1447. [2019-09-07 21:33:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-09-07 21:33:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2481 transitions. [2019-09-07 21:33:29,985 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2481 transitions. Word has length 53 [2019-09-07 21:33:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:29,987 INFO L475 AbstractCegarLoop]: Abstraction has 1447 states and 2481 transitions. [2019-09-07 21:33:29,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:33:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2481 transitions. [2019-09-07 21:33:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 21:33:30,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:30,002 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, 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 21:33:30,003 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash 671716625, now seen corresponding path program 1 times [2019-09-07 21:33:30,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:30,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:30,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:33:30,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:33:30,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:33:30,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:33:30,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:33:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:33:30,301 INFO L87 Difference]: Start difference. First operand 1447 states and 2481 transitions. Second operand 6 states. [2019-09-07 21:33:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:33:39,485 INFO L93 Difference]: Finished difference Result 5604 states and 9931 transitions. [2019-09-07 21:33:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:33:39,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-07 21:33:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:33:39,517 INFO L225 Difference]: With dead ends: 5604 [2019-09-07 21:33:39,517 INFO L226 Difference]: Without dead ends: 4163 [2019-09-07 21:33:39,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:33:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-09-07 21:33:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 4140. [2019-09-07 21:33:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-09-07 21:33:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 6054 transitions. [2019-09-07 21:33:39,650 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 6054 transitions. Word has length 131 [2019-09-07 21:33:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:39,651 INFO L475 AbstractCegarLoop]: Abstraction has 4140 states and 6054 transitions. [2019-09-07 21:33:39,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:33:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 6054 transitions. [2019-09-07 21:33:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 21:33:39,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:39,654 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, 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] [2019-09-07 21:33:39,654 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash -344284601, now seen corresponding path program 1 times [2019-09-07 21:33:39,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:39,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:33:39,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:33:39,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:33:39,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:33:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:33:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:33:39,820 INFO L87 Difference]: Start difference. First operand 4140 states and 6054 transitions. Second operand 6 states. [2019-09-07 21:33:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:33:44,820 INFO L93 Difference]: Finished difference Result 12482 states and 19729 transitions. [2019-09-07 21:33:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:33:44,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-07 21:33:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:33:44,874 INFO L225 Difference]: With dead ends: 12482 [2019-09-07 21:33:44,875 INFO L226 Difference]: Without dead ends: 8348 [2019-09-07 21:33:44,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:33:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2019-09-07 21:33:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8275. [2019-09-07 21:33:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-09-07 21:33:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 12053 transitions. [2019-09-07 21:33:45,138 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 12053 transitions. Word has length 132 [2019-09-07 21:33:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:45,139 INFO L475 AbstractCegarLoop]: Abstraction has 8275 states and 12053 transitions. [2019-09-07 21:33:45,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:33:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 12053 transitions. [2019-09-07 21:33:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-07 21:33:45,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:45,143 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:33:45,144 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2027196359, now seen corresponding path program 1 times [2019-09-07 21:33:45,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:45,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:45,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 93 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 21:33:45,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:33:45,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:33:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:33:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:45,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:33:45,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:33:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:33:45,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:33:45,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:33:45,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:33:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:33:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:33:45,646 INFO L87 Difference]: Start difference. First operand 8275 states and 12053 transitions. Second operand 9 states. [2019-09-07 21:33:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:33:52,002 INFO L93 Difference]: Finished difference Result 20630 states and 30028 transitions. [2019-09-07 21:33:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:33:52,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-07 21:33:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:33:52,072 INFO L225 Difference]: With dead ends: 20630 [2019-09-07 21:33:52,073 INFO L226 Difference]: Without dead ends: 11062 [2019-09-07 21:33:52,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:33:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11062 states. [2019-09-07 21:33:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11062 to 9266. [2019-09-07 21:33:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9266 states. [2019-09-07 21:33:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 11996 transitions. [2019-09-07 21:33:53,050 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 11996 transitions. Word has length 205 [2019-09-07 21:33:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:53,050 INFO L475 AbstractCegarLoop]: Abstraction has 9266 states and 11996 transitions. [2019-09-07 21:33:53,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:33:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 11996 transitions. [2019-09-07 21:33:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 21:33:53,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:53,054 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:33:53,055 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1552613625, now seen corresponding path program 1 times [2019-09-07 21:33:53,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:53,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 21:33:53,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:33:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:33:53,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:33:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:33:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:33:53,260 INFO L87 Difference]: Start difference. First operand 9266 states and 11996 transitions. Second operand 4 states. [2019-09-07 21:33:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:33:58,786 INFO L93 Difference]: Finished difference Result 25148 states and 34102 transitions. [2019-09-07 21:33:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:33:58,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-07 21:33:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:33:58,838 INFO L225 Difference]: With dead ends: 25148 [2019-09-07 21:33:58,838 INFO L226 Difference]: Without dead ends: 14012 [2019-09-07 21:33:58,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:33:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14012 states. [2019-09-07 21:33:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14012 to 11361. [2019-09-07 21:33:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11361 states. [2019-09-07 21:33:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11361 states to 11361 states and 13743 transitions. [2019-09-07 21:33:59,144 INFO L78 Accepts]: Start accepts. Automaton has 11361 states and 13743 transitions. Word has length 218 [2019-09-07 21:33:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:33:59,144 INFO L475 AbstractCegarLoop]: Abstraction has 11361 states and 13743 transitions. [2019-09-07 21:33:59,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:33:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11361 states and 13743 transitions. [2019-09-07 21:33:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-07 21:33:59,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:33:59,153 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:33:59,153 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:33:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:33:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash 148035714, now seen corresponding path program 1 times [2019-09-07 21:33:59,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:33:59,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:33:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:33:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 21:33:59,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:33:59,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:33:59,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:33:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:33:59,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:33:59,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:33:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:33:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 21:33:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:33:59,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-07 21:33:59,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:33:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:33:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:33:59,977 INFO L87 Difference]: Start difference. First operand 11361 states and 13743 transitions. Second operand 9 states. [2019-09-07 21:34:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:34:07,175 INFO L93 Difference]: Finished difference Result 42008 states and 54358 transitions. [2019-09-07 21:34:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 21:34:07,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2019-09-07 21:34:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:34:07,283 INFO L225 Difference]: With dead ends: 42008 [2019-09-07 21:34:07,283 INFO L226 Difference]: Without dead ends: 30202 [2019-09-07 21:34:07,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-07 21:34:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30202 states. [2019-09-07 21:34:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30202 to 27806. [2019-09-07 21:34:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27806 states. [2019-09-07 21:34:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27806 states to 27806 states and 33606 transitions. [2019-09-07 21:34:07,942 INFO L78 Accepts]: Start accepts. Automaton has 27806 states and 33606 transitions. Word has length 281 [2019-09-07 21:34:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:34:07,943 INFO L475 AbstractCegarLoop]: Abstraction has 27806 states and 33606 transitions. [2019-09-07 21:34:07,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:34:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27806 states and 33606 transitions. [2019-09-07 21:34:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-07 21:34:07,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:34:07,962 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:34:07,963 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:34:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:34:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 677862245, now seen corresponding path program 1 times [2019-09-07 21:34:07,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:34:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:34:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:07,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:34:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:34:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:34:08,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:34:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:34:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:34:08,433 INFO L87 Difference]: Start difference. First operand 27806 states and 33606 transitions. Second operand 4 states. [2019-09-07 21:34:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:34:12,378 INFO L93 Difference]: Finished difference Result 70420 states and 86550 transitions. [2019-09-07 21:34:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:34:12,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-09-07 21:34:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:34:12,515 INFO L225 Difference]: With dead ends: 70420 [2019-09-07 21:34:12,515 INFO L226 Difference]: Without dead ends: 42620 [2019-09-07 21:34:12,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:34:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42620 states. [2019-09-07 21:34:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42620 to 41299. [2019-09-07 21:34:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41299 states. [2019-09-07 21:34:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41299 states to 41299 states and 50160 transitions. [2019-09-07 21:34:13,493 INFO L78 Accepts]: Start accepts. Automaton has 41299 states and 50160 transitions. Word has length 390 [2019-09-07 21:34:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:34:13,495 INFO L475 AbstractCegarLoop]: Abstraction has 41299 states and 50160 transitions. [2019-09-07 21:34:13,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:34:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 41299 states and 50160 transitions. [2019-09-07 21:34:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-07 21:34:13,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:34:13,525 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, 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, 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] [2019-09-07 21:34:13,525 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:34:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:34:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1798487171, now seen corresponding path program 1 times [2019-09-07 21:34:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:34:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:34:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 274 proven. 141 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:34:14,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:34:14,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:34:14,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:34:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:14,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:34:14,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:34:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:34:14,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:34:14,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:34:14,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:34:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:34:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:34:14,788 INFO L87 Difference]: Start difference. First operand 41299 states and 50160 transitions. Second operand 9 states. [2019-09-07 21:34:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:34:22,785 INFO L93 Difference]: Finished difference Result 84331 states and 102088 transitions. [2019-09-07 21:34:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:34:22,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 439 [2019-09-07 21:34:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:34:22,887 INFO L225 Difference]: With dead ends: 84331 [2019-09-07 21:34:22,887 INFO L226 Difference]: Without dead ends: 43038 [2019-09-07 21:34:22,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:34:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43038 states. [2019-09-07 21:34:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43038 to 41297. [2019-09-07 21:34:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41297 states. [2019-09-07 21:34:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41297 states to 41297 states and 49887 transitions. [2019-09-07 21:34:23,622 INFO L78 Accepts]: Start accepts. Automaton has 41297 states and 49887 transitions. Word has length 439 [2019-09-07 21:34:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:34:23,623 INFO L475 AbstractCegarLoop]: Abstraction has 41297 states and 49887 transitions. [2019-09-07 21:34:23,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:34:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 41297 states and 49887 transitions. [2019-09-07 21:34:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 21:34:23,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:34:23,659 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:34:23,659 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:34:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:34:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 231340668, now seen corresponding path program 1 times [2019-09-07 21:34:23,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:34:23,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:34:23,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 389 proven. 103 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-07 21:34:25,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:34:25,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:34:25,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:25,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:34:25,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:34:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:34:25,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:34:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:34:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 561 proven. 2 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-09-07 21:34:25,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:34:25,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 21:34:25,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:34:25,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:34:25,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:34:25,637 INFO L87 Difference]: Start difference. First operand 41297 states and 49887 transitions. Second operand 11 states. [2019-09-07 21:34:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:34:37,328 INFO L93 Difference]: Finished difference Result 93139 states and 112218 transitions. [2019-09-07 21:34:37,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:34:37,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 542 [2019-09-07 21:34:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:34:37,428 INFO L225 Difference]: With dead ends: 93139 [2019-09-07 21:34:37,428 INFO L226 Difference]: Without dead ends: 50890 [2019-09-07 21:34:37,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 21:34:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50890 states. [2019-09-07 21:34:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50890 to 49967. [2019-09-07 21:34:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49967 states. [2019-09-07 21:34:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49967 states to 49967 states and 58722 transitions. [2019-09-07 21:34:38,318 INFO L78 Accepts]: Start accepts. Automaton has 49967 states and 58722 transitions. Word has length 542 [2019-09-07 21:34:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:34:38,318 INFO L475 AbstractCegarLoop]: Abstraction has 49967 states and 58722 transitions. [2019-09-07 21:34:38,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:34:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 49967 states and 58722 transitions. [2019-09-07 21:34:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-09-07 21:34:38,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:34:38,356 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:34:38,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:34:38,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:34:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -706025391, now seen corresponding path program 1 times [2019-09-07 21:34:38,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:34:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:34:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 420 proven. 206 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-09-07 21:34:38,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:34:38,877 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) [2019-09-07 21:34:38,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:34:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:39,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:34:39,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:34:39,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:34:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 796 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 21:34:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:34:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:34:39,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:34:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:34:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:34:39,576 INFO L87 Difference]: Start difference. First operand 49967 states and 58722 transitions. Second operand 9 states. [2019-09-07 21:34:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:34:50,740 INFO L93 Difference]: Finished difference Result 112441 states and 133660 transitions. [2019-09-07 21:34:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 21:34:50,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 608 [2019-09-07 21:34:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:34:50,862 INFO L225 Difference]: With dead ends: 112441 [2019-09-07 21:34:50,862 INFO L226 Difference]: Without dead ends: 62479 [2019-09-07 21:34:50,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 21:34:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62479 states. [2019-09-07 21:34:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62479 to 58078. [2019-09-07 21:34:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58078 states. [2019-09-07 21:34:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58078 states to 58078 states and 68025 transitions. [2019-09-07 21:34:51,683 INFO L78 Accepts]: Start accepts. Automaton has 58078 states and 68025 transitions. Word has length 608 [2019-09-07 21:34:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:34:51,684 INFO L475 AbstractCegarLoop]: Abstraction has 58078 states and 68025 transitions. [2019-09-07 21:34:51,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:34:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 58078 states and 68025 transitions. [2019-09-07 21:34:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-07 21:34:51,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:34:51,712 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, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:34:51,712 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:34:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:34:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 626105351, now seen corresponding path program 1 times [2019-09-07 21:34:51,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:34:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:34:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:34:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 668 proven. 96 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 21:34:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:34:52,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:34:53,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:34:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:34:53,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:34:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:34:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 758 proven. 6 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 21:34:53,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:34:53,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-07 21:34:53,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:34:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:34:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:34:53,921 INFO L87 Difference]: Start difference. First operand 58078 states and 68025 transitions. Second operand 14 states. [2019-09-07 21:35:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:35:26,472 INFO L93 Difference]: Finished difference Result 187405 states and 220855 transitions. [2019-09-07 21:35:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-07 21:35:26,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 613 [2019-09-07 21:35:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:35:27,116 INFO L225 Difference]: With dead ends: 187405 [2019-09-07 21:35:27,116 INFO L226 Difference]: Without dead ends: 124951 [2019-09-07 21:35:27,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7554 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2919, Invalid=15441, Unknown=0, NotChecked=0, Total=18360 [2019-09-07 21:35:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124951 states. [2019-09-07 21:35:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124951 to 115147. [2019-09-07 21:35:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115147 states. [2019-09-07 21:35:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115147 states to 115147 states and 133733 transitions. [2019-09-07 21:35:28,695 INFO L78 Accepts]: Start accepts. Automaton has 115147 states and 133733 transitions. Word has length 613 [2019-09-07 21:35:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:35:28,697 INFO L475 AbstractCegarLoop]: Abstraction has 115147 states and 133733 transitions. [2019-09-07 21:35:28,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:35:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 115147 states and 133733 transitions. [2019-09-07 21:35:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-09-07 21:35:28,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:35:28,727 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, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:35:28,728 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:35:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:35:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 291442735, now seen corresponding path program 1 times [2019-09-07 21:35:28,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:35:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:35:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:28,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 673 proven. 96 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 21:35:29,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:35:29,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:35:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:31,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:35:31,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:35:31,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:35:31,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:35:31,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:31,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:36:07,448 WARN L188 SmtUtils]: Spent 33.66 s on a formula simplification. DAG size of input: 105 DAG size of output: 50 [2019-09-07 21:36:07,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:36:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2019-09-07 21:36:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:36:10,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-07 21:36:10,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:36:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:36:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:36:10,206 INFO L87 Difference]: Start difference. First operand 115147 states and 133733 transitions. Second operand 10 states. [2019-09-07 21:36:19,067 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 21:36:20,349 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 21:36:21,930 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-07 21:36:24,406 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 21:36:25,731 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 21:36:28,298 WARN L188 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 21:36:32,486 WARN L188 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-07 21:36:36,611 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 21:36:38,705 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 21:37:06,775 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-07 21:37:08,130 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 21:37:11,539 WARN L188 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 21:37:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:23,484 INFO L93 Difference]: Finished difference Result 280296 states and 326002 transitions. [2019-09-07 21:37:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 21:37:23,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 618 [2019-09-07 21:37:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:23,800 INFO L225 Difference]: With dead ends: 280296 [2019-09-07 21:37:23,800 INFO L226 Difference]: Without dead ends: 159913 [2019-09-07 21:37:23,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=233, Invalid=635, Unknown=2, NotChecked=0, Total=870 [2019-09-07 21:37:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159913 states. [2019-09-07 21:37:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159913 to 157992. [2019-09-07 21:37:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157992 states. [2019-09-07 21:37:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157992 states to 157992 states and 183970 transitions. [2019-09-07 21:37:25,678 INFO L78 Accepts]: Start accepts. Automaton has 157992 states and 183970 transitions. Word has length 618 [2019-09-07 21:37:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:25,680 INFO L475 AbstractCegarLoop]: Abstraction has 157992 states and 183970 transitions. [2019-09-07 21:37:25,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:37:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 157992 states and 183970 transitions. [2019-09-07 21:37:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-09-07 21:37:25,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:25,730 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:25,730 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1860716463, now seen corresponding path program 1 times [2019-09-07 21:37:25,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:25,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:25,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 634 proven. 103 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-07 21:37:28,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:28,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:37:28,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:29,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:37:29,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 971 proven. 2 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:37:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:37:29,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 21:37:29,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:37:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:37:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:37:29,572 INFO L87 Difference]: Start difference. First operand 157992 states and 183970 transitions. Second operand 7 states. [2019-09-07 21:37:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:34,711 INFO L93 Difference]: Finished difference Result 315469 states and 367907 transitions. [2019-09-07 21:37:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 21:37:34,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 704 [2019-09-07 21:37:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:35,060 INFO L225 Difference]: With dead ends: 315469 [2019-09-07 21:37:35,060 INFO L226 Difference]: Without dead ends: 157483 [2019-09-07 21:37:35,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:37:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157483 states. [2019-09-07 21:37:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157483 to 154866. [2019-09-07 21:37:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154866 states. [2019-09-07 21:37:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154866 states to 154866 states and 179839 transitions. [2019-09-07 21:37:37,301 INFO L78 Accepts]: Start accepts. Automaton has 154866 states and 179839 transitions. Word has length 704 [2019-09-07 21:37:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:37,302 INFO L475 AbstractCegarLoop]: Abstraction has 154866 states and 179839 transitions. [2019-09-07 21:37:37,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:37:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 154866 states and 179839 transitions. [2019-09-07 21:37:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-09-07 21:37:37,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:37,356 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:37:37,356 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2125548229, now seen corresponding path program 1 times [2019-09-07 21:37:37,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 590 proven. 45 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-09-07 21:37:38,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:38,528 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) [2019-09-07 21:37:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:37:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:38,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 21:37:38,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:38,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 586 proven. 49 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-09-07 21:37:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:37:41,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 21:37:41,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:37:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:37:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2019-09-07 21:37:41,471 INFO L87 Difference]: Start difference. First operand 154866 states and 179839 transitions. Second operand 10 states. [2019-09-07 21:39:42,413 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-09-07 21:40:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:40:24,347 INFO L93 Difference]: Finished difference Result 421949 states and 489047 transitions. [2019-09-07 21:40:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 21:40:24,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 748 [2019-09-07 21:40:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:40:24,982 INFO L225 Difference]: With dead ends: 421949 [2019-09-07 21:40:24,982 INFO L226 Difference]: Without dead ends: 264016 [2019-09-07 21:40:25,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=75, Invalid=196, Unknown=1, NotChecked=0, Total=272 [2019-09-07 21:40:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264016 states. [2019-09-07 21:40:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264016 to 261775. [2019-09-07 21:40:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261775 states. [2019-09-07 21:40:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261775 states to 261775 states and 303374 transitions. [2019-09-07 21:40:32,940 INFO L78 Accepts]: Start accepts. Automaton has 261775 states and 303374 transitions. Word has length 748 [2019-09-07 21:40:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:40:32,941 INFO L475 AbstractCegarLoop]: Abstraction has 261775 states and 303374 transitions. [2019-09-07 21:40:32,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:40:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 261775 states and 303374 transitions. [2019-09-07 21:40:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2019-09-07 21:40:33,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:40:33,014 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 21:40:33,015 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:40:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:40:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash -26693943, now seen corresponding path program 1 times [2019-09-07 21:40:33,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:40:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:40:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:40:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 597 proven. 132 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2019-09-07 21:40:33,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:40:33,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:40:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:40:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:33,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:40:33,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:40:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 1058 proven. 2 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-07 21:40:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:40:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 21:40:37,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:40:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:40:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:40:37,455 INFO L87 Difference]: Start difference. First operand 261775 states and 303374 transitions. Second operand 7 states. [2019-09-07 21:40:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:40:45,295 INFO L93 Difference]: Finished difference Result 526153 states and 610159 transitions. [2019-09-07 21:40:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 21:40:45,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 787 [2019-09-07 21:40:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:40:45,890 INFO L225 Difference]: With dead ends: 526153 [2019-09-07 21:40:45,890 INFO L226 Difference]: Without dead ends: 264383 [2019-09-07 21:40:46,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 791 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:40:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264383 states. [2019-09-07 21:40:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264383 to 263913. [2019-09-07 21:40:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263913 states. [2019-09-07 21:40:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263913 states to 263913 states and 304328 transitions. [2019-09-07 21:40:49,693 INFO L78 Accepts]: Start accepts. Automaton has 263913 states and 304328 transitions. Word has length 787 [2019-09-07 21:40:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:40:49,694 INFO L475 AbstractCegarLoop]: Abstraction has 263913 states and 304328 transitions. [2019-09-07 21:40:49,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:40:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 263913 states and 304328 transitions. [2019-09-07 21:40:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2019-09-07 21:40:49,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:40:49,776 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:40:49,777 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:40:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:40:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 732402028, now seen corresponding path program 1 times [2019-09-07 21:40:49,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:40:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:40:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:40:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 309 proven. 4 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-09-07 21:40:51,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:40:51,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:40:51,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:40:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:51,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:40:51,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:40:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 1228 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-09-07 21:40:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:40:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 21:40:51,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:40:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:40:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:40:51,643 INFO L87 Difference]: Start difference. First operand 263913 states and 304328 transitions. Second operand 5 states. [2019-09-07 21:40:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:40:55,655 INFO L93 Difference]: Finished difference Result 500528 states and 577525 transitions. [2019-09-07 21:40:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:40:55,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 852 [2019-09-07 21:40:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:40:56,226 INFO L225 Difference]: With dead ends: 500528 [2019-09-07 21:40:56,227 INFO L226 Difference]: Without dead ends: 236620 [2019-09-07 21:40:56,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 851 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:40:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236620 states. [2019-09-07 21:41:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236620 to 234839. [2019-09-07 21:41:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234839 states. [2019-09-07 21:41:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234839 states to 234839 states and 270545 transitions. [2019-09-07 21:41:05,189 INFO L78 Accepts]: Start accepts. Automaton has 234839 states and 270545 transitions. Word has length 852 [2019-09-07 21:41:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:41:05,190 INFO L475 AbstractCegarLoop]: Abstraction has 234839 states and 270545 transitions. [2019-09-07 21:41:05,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:41:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 234839 states and 270545 transitions. [2019-09-07 21:41:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2019-09-07 21:41:05,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:41:05,299 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:41:05,299 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:41:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:41:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -797899053, now seen corresponding path program 1 times [2019-09-07 21:41:05,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:41:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:41:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:41:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:41:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:41:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:41:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 733 proven. 45 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-09-07 21:41:06,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:41:06,726 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 21:41:06,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:41:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:41:10,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 21:41:10,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:41:10,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:41:10,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:41:10,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 21:41:10,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:41:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:41:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:41:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:41:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:41:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 819 proven. 250 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-07 21:41:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:41:11,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2019-09-07 21:41:11,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 21:41:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 21:41:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-07 21:41:11,699 INFO L87 Difference]: Start difference. First operand 234839 states and 270545 transitions. Second operand 18 states. [2019-09-07 21:41:42,875 WARN L188 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-07 21:42:11,325 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-09-07 21:42:46,581 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-07 21:42:52,108 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 21:43:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:10,673 INFO L93 Difference]: Finished difference Result 563109 states and 648847 transitions. [2019-09-07 21:43:10,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-09-07 21:43:10,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 935 [2019-09-07 21:43:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:11,392 INFO L225 Difference]: With dead ends: 563109 [2019-09-07 21:43:11,392 INFO L226 Difference]: Without dead ends: 327401 [2019-09-07 21:43:11,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1082 SyntacticMatches, 5 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22379 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=5701, Invalid=44251, Unknown=0, NotChecked=0, Total=49952 [2019-09-07 21:43:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327401 states. [2019-09-07 21:43:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327401 to 320269. [2019-09-07 21:43:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320269 states. [2019-09-07 21:43:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320269 states to 320269 states and 365240 transitions. [2019-09-07 21:43:16,971 INFO L78 Accepts]: Start accepts. Automaton has 320269 states and 365240 transitions. Word has length 935 [2019-09-07 21:43:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:16,971 INFO L475 AbstractCegarLoop]: Abstraction has 320269 states and 365240 transitions. [2019-09-07 21:43:16,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 21:43:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 320269 states and 365240 transitions. [2019-09-07 21:43:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-09-07 21:43:17,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:17,105 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:43:17,105 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:17,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1037047320, now seen corresponding path program 1 times [2019-09-07 21:43:17,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:17,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:17,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:17,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:17,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 654 proven. 306 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2019-09-07 21:43:19,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:19,711 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) [2019-09-07 21:43:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:43:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 21:43:20,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:43:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:43:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:43:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:43:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:20,519 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-07 21:43:20,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:43:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 679 proven. 907 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2019-09-07 21:43:29,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:43:29,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 21:43:29,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:43:29,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:43:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=127, Unknown=1, NotChecked=0, Total=156 [2019-09-07 21:43:29,992 INFO L87 Difference]: Start difference. First operand 320269 states and 365240 transitions. Second operand 13 states. [2019-09-07 21:43:54,837 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-07 21:44:12,100 WARN L188 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-07 21:44:46,919 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-07 21:44:51,373 WARN L188 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-07 21:45:49,148 WARN L188 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 81 DAG size of output: 56