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/Problem11_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:07:10,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:07:10,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:07:10,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:07:10,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:07:10,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:07:10,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:07:10,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:07:10,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:07:10,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:07:10,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:07:10,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:07:10,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:07:10,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:07:10,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:07:10,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:07:10,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:07:10,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:07:10,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:07:10,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:07:10,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:07:10,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:07:10,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:07:10,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:07:10,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:07:10,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:07:10,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:07:10,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:07:10,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:07:10,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:07:10,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:07:10,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:07:10,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:07:10,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:07:10,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:07:10,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:07:10,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:07:10,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:07:10,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:07:10,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:07:10,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:07:10,419 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-10-02 01:07:10,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:07:10,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:07:10,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:07:10,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:07:10,435 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:07:10,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:07:10,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:07:10,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:07:10,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:07:10,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:07:10,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:07:10,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:07:10,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:07:10,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:07:10,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:07:10,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:07:10,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:07:10,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:07:10,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:07:10,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:07:10,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:07:10,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:07:10,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:07:10,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:07:10,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:07:10,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:07:10,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:07:10,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:07:10,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:07:10,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:07:10,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:07:10,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:07:10,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:07:10,512 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:07:10,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label28.c [2019-10-02 01:07:10,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f81adad6/70399d0d27674f5c82885d6d040dd8ce/FLAGd86e1e7f2 [2019-10-02 01:07:11,224 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:07:11,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label28.c [2019-10-02 01:07:11,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f81adad6/70399d0d27674f5c82885d6d040dd8ce/FLAGd86e1e7f2 [2019-10-02 01:07:11,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f81adad6/70399d0d27674f5c82885d6d040dd8ce [2019-10-02 01:07:11,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:07:11,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:07:11,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:07:11,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:07:11,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:07:11,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:07:11" (1/1) ... [2019-10-02 01:07:11,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bebede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:11, skipping insertion in model container [2019-10-02 01:07:11,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:07:11" (1/1) ... [2019-10-02 01:07:11,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:07:11,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:07:12,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:07:12,110 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:07:12,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:07:12,375 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:07:12,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12 WrapperNode [2019-10-02 01:07:12,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:07:12,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:07:12,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:07:12,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:07:12,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (1/1) ... [2019-10-02 01:07:12,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:07:12,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:07:12,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:07:12,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:07:12,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (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-10-02 01:07:12,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:07:12,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:07:12,605 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:07:12,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:07:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:07:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:07:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:07:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:07:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:07:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:07:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:07:14,336 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:07:14,337 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:07:14,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:07:14 BoogieIcfgContainer [2019-10-02 01:07:14,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:07:14,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:07:14,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:07:14,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:07:14,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:07:11" (1/3) ... [2019-10-02 01:07:14,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac6146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:07:14, skipping insertion in model container [2019-10-02 01:07:14,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:07:12" (2/3) ... [2019-10-02 01:07:14,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac6146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:07:14, skipping insertion in model container [2019-10-02 01:07:14,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:07:14" (3/3) ... [2019-10-02 01:07:14,348 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2019-10-02 01:07:14,359 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:07:14,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:07:14,388 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:07:14,425 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:07:14,426 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:07:14,426 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:07:14,427 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:07:14,427 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:07:14,427 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:07:14,427 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:07:14,427 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:07:14,428 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:07:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-02 01:07:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 01:07:14,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:14,464 INFO L411 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, 1] [2019-10-02 01:07:14,466 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1610348989, now seen corresponding path program 1 times [2019-10-02 01:07:14,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:14,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:14,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:07:14,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:07:14,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:07:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:07:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:07:14,949 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-02 01:07:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:17,013 INFO L93 Difference]: Finished difference Result 978 states and 1754 transitions. [2019-10-02 01:07:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:07:17,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-10-02 01:07:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:17,038 INFO L225 Difference]: With dead ends: 978 [2019-10-02 01:07:17,038 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 01:07:17,048 INFO L640 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-10-02 01:07:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 01:07:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 01:07:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 01:07:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 859 transitions. [2019-10-02 01:07:17,151 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 859 transitions. Word has length 54 [2019-10-02 01:07:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:17,152 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 859 transitions. [2019-10-02 01:07:17,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:07:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 859 transitions. [2019-10-02 01:07:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 01:07:17,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:17,160 INFO L411 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:07:17,160 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1973618443, now seen corresponding path program 1 times [2019-10-02 01:07:17,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:17,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:17,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:17,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:07:17,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:07:17,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:07:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:07:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:07:17,403 INFO L87 Difference]: Start difference. First operand 619 states and 859 transitions. Second operand 4 states. [2019-10-02 01:07:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:19,274 INFO L93 Difference]: Finished difference Result 2378 states and 3384 transitions. [2019-10-02 01:07:19,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:07:19,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-02 01:07:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:19,288 INFO L225 Difference]: With dead ends: 2378 [2019-10-02 01:07:19,288 INFO L226 Difference]: Without dead ends: 1765 [2019-10-02 01:07:19,291 INFO L640 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-10-02 01:07:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-10-02 01:07:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1750. [2019-10-02 01:07:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-10-02 01:07:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2347 transitions. [2019-10-02 01:07:19,365 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2347 transitions. Word has length 127 [2019-10-02 01:07:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:19,366 INFO L475 AbstractCegarLoop]: Abstraction has 1750 states and 2347 transitions. [2019-10-02 01:07:19,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:07:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2347 transitions. [2019-10-02 01:07:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 01:07:19,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:19,374 INFO L411 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, 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-10-02 01:07:19,375 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1199392174, now seen corresponding path program 1 times [2019-10-02 01:07:19,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:19,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:07:19,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:07:19,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:07:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:07:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:07:19,628 INFO L87 Difference]: Start difference. First operand 1750 states and 2347 transitions. Second operand 6 states. [2019-10-02 01:07:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:21,442 INFO L93 Difference]: Finished difference Result 4688 states and 6402 transitions. [2019-10-02 01:07:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:07:21,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-02 01:07:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:21,462 INFO L225 Difference]: With dead ends: 4688 [2019-10-02 01:07:21,462 INFO L226 Difference]: Without dead ends: 2944 [2019-10-02 01:07:21,468 INFO L640 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-10-02 01:07:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-10-02 01:07:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2929. [2019-10-02 01:07:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2019-10-02 01:07:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3748 transitions. [2019-10-02 01:07:21,590 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3748 transitions. Word has length 134 [2019-10-02 01:07:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:21,591 INFO L475 AbstractCegarLoop]: Abstraction has 2929 states and 3748 transitions. [2019-10-02 01:07:21,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:07:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3748 transitions. [2019-10-02 01:07:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 01:07:21,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:21,610 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:07:21,610 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash -91916028, now seen corresponding path program 1 times [2019-10-02 01:07:21,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:21,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:21,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:21,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 44 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:22,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:07:22,140 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:07:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:22,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:07:22,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:07:22,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:07:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:07:22,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:07:22,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 01:07:22,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:07:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:07:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:07:22,479 INFO L87 Difference]: Start difference. First operand 2929 states and 3748 transitions. Second operand 15 states. [2019-10-02 01:07:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:36,688 INFO L93 Difference]: Finished difference Result 11918 states and 17174 transitions. [2019-10-02 01:07:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 01:07:36,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2019-10-02 01:07:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:36,740 INFO L225 Difference]: With dead ends: 11918 [2019-10-02 01:07:36,740 INFO L226 Difference]: Without dead ends: 8995 [2019-10-02 01:07:36,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=700, Invalid=3082, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 01:07:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8995 states. [2019-10-02 01:07:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8995 to 8373. [2019-10-02 01:07:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8373 states. [2019-10-02 01:07:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8373 states to 8373 states and 11311 transitions. [2019-10-02 01:07:37,032 INFO L78 Accepts]: Start accepts. Automaton has 8373 states and 11311 transitions. Word has length 207 [2019-10-02 01:07:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:37,034 INFO L475 AbstractCegarLoop]: Abstraction has 8373 states and 11311 transitions. [2019-10-02 01:07:37,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:07:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8373 states and 11311 transitions. [2019-10-02 01:07:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 01:07:37,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:37,052 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:07:37,052 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1891565748, now seen corresponding path program 1 times [2019-10-02 01:07:37,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:37,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:37,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:07:37,411 INFO L224 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-10-02 01:07:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:37,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:07:37,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:07:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:37,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:07:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:07:37,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:07:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:07:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:07:37,802 INFO L87 Difference]: Start difference. First operand 8373 states and 11311 transitions. Second operand 9 states. [2019-10-02 01:07:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:41,065 INFO L93 Difference]: Finished difference Result 19193 states and 30317 transitions. [2019-10-02 01:07:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:07:41,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 290 [2019-10-02 01:07:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:41,160 INFO L225 Difference]: With dead ends: 19193 [2019-10-02 01:07:41,160 INFO L226 Difference]: Without dead ends: 11202 [2019-10-02 01:07:41,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:07:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2019-10-02 01:07:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 10784. [2019-10-02 01:07:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10784 states. [2019-10-02 01:07:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10784 states to 10784 states and 14319 transitions. [2019-10-02 01:07:41,615 INFO L78 Accepts]: Start accepts. Automaton has 10784 states and 14319 transitions. Word has length 290 [2019-10-02 01:07:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:41,616 INFO L475 AbstractCegarLoop]: Abstraction has 10784 states and 14319 transitions. [2019-10-02 01:07:41,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:07:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10784 states and 14319 transitions. [2019-10-02 01:07:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 01:07:41,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:41,628 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:07:41,629 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 11397960, now seen corresponding path program 1 times [2019-10-02 01:07:41,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:41,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:41,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 01:07:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:07:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:07:41,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:07:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:07:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:07:41,881 INFO L87 Difference]: Start difference. First operand 10784 states and 14319 transitions. Second operand 3 states. [2019-10-02 01:07:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:42,982 INFO L93 Difference]: Finished difference Result 24010 states and 32493 transitions. [2019-10-02 01:07:42,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:07:42,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 01:07:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:43,123 INFO L225 Difference]: With dead ends: 24010 [2019-10-02 01:07:43,124 INFO L226 Difference]: Without dead ends: 13610 [2019-10-02 01:07:43,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:07:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13610 states. [2019-10-02 01:07:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13610 to 12100. [2019-10-02 01:07:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12100 states. [2019-10-02 01:07:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12100 states to 12100 states and 16053 transitions. [2019-10-02 01:07:43,407 INFO L78 Accepts]: Start accepts. Automaton has 12100 states and 16053 transitions. Word has length 292 [2019-10-02 01:07:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:43,408 INFO L475 AbstractCegarLoop]: Abstraction has 12100 states and 16053 transitions. [2019-10-02 01:07:43,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:07:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12100 states and 16053 transitions. [2019-10-02 01:07:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 01:07:43,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:43,419 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:07:43,419 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2077675608, now seen corresponding path program 1 times [2019-10-02 01:07:43,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:43,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:43,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 7 proven. 93 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 01:07:43,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:07:43,778 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:07:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:07:43,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:07:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:07:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:07:44,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:07:44,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-02 01:07:44,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:07:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:07:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:07:44,254 INFO L87 Difference]: Start difference. First operand 12100 states and 16053 transitions. Second operand 15 states. [2019-10-02 01:07:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:07:56,291 INFO L93 Difference]: Finished difference Result 40824 states and 60679 transitions. [2019-10-02 01:07:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-02 01:07:56,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 295 [2019-10-02 01:07:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:07:56,424 INFO L225 Difference]: With dead ends: 40824 [2019-10-02 01:07:56,424 INFO L226 Difference]: Without dead ends: 29108 [2019-10-02 01:07:56,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3414 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1238, Invalid=7692, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 01:07:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29108 states. [2019-10-02 01:07:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29108 to 27837. [2019-10-02 01:07:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27837 states. [2019-10-02 01:07:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27837 states to 27837 states and 37590 transitions. [2019-10-02 01:07:58,083 INFO L78 Accepts]: Start accepts. Automaton has 27837 states and 37590 transitions. Word has length 295 [2019-10-02 01:07:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:07:58,084 INFO L475 AbstractCegarLoop]: Abstraction has 27837 states and 37590 transitions. [2019-10-02 01:07:58,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:07:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27837 states and 37590 transitions. [2019-10-02 01:07:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-10-02 01:07:58,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:07:58,142 INFO L411 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:07:58,143 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:07:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:07:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash 636376888, now seen corresponding path program 1 times [2019-10-02 01:07:58,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:07:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:07:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:07:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:07:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 11 proven. 145 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-10-02 01:07:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:07:58,570 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:07:58,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:07:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:07:58,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 01:07:58,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:07:58,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:07:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 360 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 01:07:59,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:07:59,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-02 01:07:59,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:07:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:07:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:07:59,154 INFO L87 Difference]: Start difference. First operand 27837 states and 37590 transitions. Second operand 15 states. [2019-10-02 01:08:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:11,284 INFO L93 Difference]: Finished difference Result 73011 states and 105479 transitions. [2019-10-02 01:08:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-02 01:08:11,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 411 [2019-10-02 01:08:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:11,518 INFO L225 Difference]: With dead ends: 73011 [2019-10-02 01:08:11,519 INFO L226 Difference]: Without dead ends: 47321 [2019-10-02 01:08:11,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2872 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1147, Invalid=6509, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 01:08:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47321 states. [2019-10-02 01:08:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47321 to 45293. [2019-10-02 01:08:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45293 states. [2019-10-02 01:08:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45293 states to 45293 states and 61141 transitions. [2019-10-02 01:08:12,741 INFO L78 Accepts]: Start accepts. Automaton has 45293 states and 61141 transitions. Word has length 411 [2019-10-02 01:08:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:12,742 INFO L475 AbstractCegarLoop]: Abstraction has 45293 states and 61141 transitions. [2019-10-02 01:08:12,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:08:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45293 states and 61141 transitions. [2019-10-02 01:08:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-10-02 01:08:12,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:12,817 INFO L411 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:08:12,818 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1933389118, now seen corresponding path program 1 times [2019-10-02 01:08:12,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:12,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:12,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 371 proven. 100 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-10-02 01:08:13,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:13,445 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:08:13,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:13,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:08:13,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 01:08:13,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:08:13,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 01:08:13,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:08:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:08:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:08:13,711 INFO L87 Difference]: Start difference. First operand 45293 states and 61141 transitions. Second operand 7 states. [2019-10-02 01:08:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:18,841 INFO L93 Difference]: Finished difference Result 112110 states and 169006 transitions. [2019-10-02 01:08:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 01:08:18,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 451 [2019-10-02 01:08:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:19,221 INFO L225 Difference]: With dead ends: 112110 [2019-10-02 01:08:19,221 INFO L226 Difference]: Without dead ends: 67201 [2019-10-02 01:08:19,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:08:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67201 states. [2019-10-02 01:08:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67201 to 65310. [2019-10-02 01:08:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65310 states. [2019-10-02 01:08:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65310 states to 65310 states and 98390 transitions. [2019-10-02 01:08:22,739 INFO L78 Accepts]: Start accepts. Automaton has 65310 states and 98390 transitions. Word has length 451 [2019-10-02 01:08:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:22,740 INFO L475 AbstractCegarLoop]: Abstraction has 65310 states and 98390 transitions. [2019-10-02 01:08:22,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:08:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 65310 states and 98390 transitions. [2019-10-02 01:08:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-10-02 01:08:22,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:22,852 INFO L411 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:08:22,852 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2007139003, now seen corresponding path program 1 times [2019-10-02 01:08:22,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:22,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:22,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 449 proven. 170 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 01:08:24,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:24,786 INFO L224 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-10-02 01:08:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:24,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:08:25,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 461 proven. 2 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-02 01:08:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:08:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2019-10-02 01:08:25,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 01:08:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 01:08:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:08:25,174 INFO L87 Difference]: Start difference. First operand 65310 states and 98390 transitions. Second operand 22 states. [2019-10-02 01:08:29,296 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-10-02 01:08:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:50,714 INFO L93 Difference]: Finished difference Result 142063 states and 233306 transitions. [2019-10-02 01:08:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-10-02 01:08:50,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 454 [2019-10-02 01:08:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:51,064 INFO L225 Difference]: With dead ends: 142063 [2019-10-02 01:08:51,064 INFO L226 Difference]: Without dead ends: 75477 [2019-10-02 01:08:51,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 536 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8720 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3041, Invalid=19309, Unknown=0, NotChecked=0, Total=22350 [2019-10-02 01:08:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75477 states. [2019-10-02 01:08:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75477 to 68945. [2019-10-02 01:08:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68945 states. [2019-10-02 01:08:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68945 states to 68945 states and 91143 transitions. [2019-10-02 01:08:55,175 INFO L78 Accepts]: Start accepts. Automaton has 68945 states and 91143 transitions. Word has length 454 [2019-10-02 01:08:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:55,175 INFO L475 AbstractCegarLoop]: Abstraction has 68945 states and 91143 transitions. [2019-10-02 01:08:55,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 01:08:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 68945 states and 91143 transitions. [2019-10-02 01:08:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-10-02 01:08:55,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:55,263 INFO L411 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:08:55,263 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -153899112, now seen corresponding path program 1 times [2019-10-02 01:08:55,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 497 proven. 236 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 01:08:56,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:56,998 INFO L224 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-10-02 01:08:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:57,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:08:57,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:57,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:08:57,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:08:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 706 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 01:08:57,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:08:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2019-10-02 01:08:57,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 01:08:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 01:08:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:08:57,516 INFO L87 Difference]: Start difference. First operand 68945 states and 91143 transitions. Second operand 22 states. [2019-10-02 01:08:59,601 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 01:09:03,551 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 01:09:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:16,066 INFO L93 Difference]: Finished difference Result 149315 states and 204374 transitions. [2019-10-02 01:09:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-02 01:09:16,066 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 534 [2019-10-02 01:09:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:16,296 INFO L225 Difference]: With dead ends: 149315 [2019-10-02 01:09:16,296 INFO L226 Difference]: Without dead ends: 77768 [2019-10-02 01:09:16,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 614 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5498 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2177, Invalid=12103, Unknown=0, NotChecked=0, Total=14280 [2019-10-02 01:09:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77768 states. [2019-10-02 01:09:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77768 to 71472. [2019-10-02 01:09:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71472 states. [2019-10-02 01:09:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71472 states to 71472 states and 89694 transitions. [2019-10-02 01:09:17,969 INFO L78 Accepts]: Start accepts. Automaton has 71472 states and 89694 transitions. Word has length 534 [2019-10-02 01:09:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:17,970 INFO L475 AbstractCegarLoop]: Abstraction has 71472 states and 89694 transitions. [2019-10-02 01:09:17,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 01:09:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71472 states and 89694 transitions. [2019-10-02 01:09:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2019-10-02 01:09:18,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:18,096 INFO L411 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, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:09:18,096 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 201783405, now seen corresponding path program 1 times [2019-10-02 01:09:18,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:18,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:18,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:18,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 257 proven. 4 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2019-10-02 01:09:18,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:18,948 INFO L224 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-10-02 01:09:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:19,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:09:19,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2019-10-02 01:09:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:09:19,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 01:09:19,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:09:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:09:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:09:19,598 INFO L87 Difference]: Start difference. First operand 71472 states and 89694 transitions. Second operand 3 states. [2019-10-02 01:09:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:21,303 INFO L93 Difference]: Finished difference Result 128052 states and 160670 transitions. [2019-10-02 01:09:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:09:21,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 583 [2019-10-02 01:09:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:21,507 INFO L225 Difference]: With dead ends: 128052 [2019-10-02 01:09:21,507 INFO L226 Difference]: Without dead ends: 72274 [2019-10-02 01:09:21,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:09:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72274 states. [2019-10-02 01:09:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72274 to 69900. [2019-10-02 01:09:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69900 states. [2019-10-02 01:09:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69900 states to 69900 states and 87831 transitions. [2019-10-02 01:09:25,245 INFO L78 Accepts]: Start accepts. Automaton has 69900 states and 87831 transitions. Word has length 583 [2019-10-02 01:09:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:25,245 INFO L475 AbstractCegarLoop]: Abstraction has 69900 states and 87831 transitions. [2019-10-02 01:09:25,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:09:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 69900 states and 87831 transitions. [2019-10-02 01:09:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2019-10-02 01:09:25,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:25,362 INFO L411 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-10-02 01:09:25,362 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1525436706, now seen corresponding path program 1 times [2019-10-02 01:09:25,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:25,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 17 proven. 275 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-10-02 01:09:26,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:26,218 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:26,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 01:09:26,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:26,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:26,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:28,527 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-10-02 01:09:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 594 proven. 46 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2019-10-02 01:09:28,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:28,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2019-10-02 01:09:28,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:09:28,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:09:28,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=242, Unknown=1, NotChecked=0, Total=306 [2019-10-02 01:09:28,904 INFO L87 Difference]: Start difference. First operand 69900 states and 87831 transitions. Second operand 18 states. [2019-10-02 01:09:48,335 WARN L191 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 01:09:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:52,799 INFO L93 Difference]: Finished difference Result 196284 states and 254188 transitions. [2019-10-02 01:09:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 01:09:52,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 610 [2019-10-02 01:09:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:53,265 INFO L225 Difference]: With dead ends: 196284 [2019-10-02 01:09:53,265 INFO L226 Difference]: Without dead ends: 136532 [2019-10-02 01:09:53,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 641 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=417, Invalid=2132, Unknown=1, NotChecked=0, Total=2550 [2019-10-02 01:09:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136532 states. [2019-10-02 01:09:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136532 to 122232. [2019-10-02 01:09:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122232 states. [2019-10-02 01:09:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122232 states to 122232 states and 152607 transitions. [2019-10-02 01:09:58,871 INFO L78 Accepts]: Start accepts. Automaton has 122232 states and 152607 transitions. Word has length 610 [2019-10-02 01:09:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:58,871 INFO L475 AbstractCegarLoop]: Abstraction has 122232 states and 152607 transitions. [2019-10-02 01:09:58,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:09:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 122232 states and 152607 transitions. [2019-10-02 01:09:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-10-02 01:09:59,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:59,018 INFO L411 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, 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, 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, 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] [2019-10-02 01:09:59,018 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -264756293, now seen corresponding path program 1 times [2019-10-02 01:09:59,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:59,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:59,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:59,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:59,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 698 proven. 505 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 01:10:00,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:00,119 INFO L224 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-10-02 01:10:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:00,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 01:10:00,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:00,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:00,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:02,343 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-10-02 01:10:02,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-10-02 01:10:04,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:10:04,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-10-02 01:10:04,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 01:10:04,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 01:10:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=433, Unknown=1, NotChecked=0, Total=506 [2019-10-02 01:10:04,220 INFO L87 Difference]: Start difference. First operand 122232 states and 152607 transitions. Second operand 23 states. [2019-10-02 01:10:11,929 WARN L191 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-10-02 01:10:24,362 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-10-02 01:10:30,548 WARN L191 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-10-02 01:10:58,139 WARN L191 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-10-02 01:11:04,464 WARN L191 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-10-02 01:12:32,675 WARN L191 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-10-02 01:12:50,539 WARN L191 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-10-02 01:13:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:13:11,184 INFO L93 Difference]: Finished difference Result 315073 states and 398634 transitions. [2019-10-02 01:13:11,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-10-02 01:13:11,185 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 652 [2019-10-02 01:13:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:13:11,846 INFO L225 Difference]: With dead ends: 315073 [2019-10-02 01:13:11,846 INFO L226 Difference]: Without dead ends: 193229 [2019-10-02 01:13:12,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 735 SyntacticMatches, 2 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24819 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=6404, Invalid=51431, Unknown=5, NotChecked=0, Total=57840 [2019-10-02 01:13:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193229 states. [2019-10-02 01:13:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193229 to 178752. [2019-10-02 01:13:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178752 states. [2019-10-02 01:13:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178752 states to 178752 states and 215903 transitions. [2019-10-02 01:13:20,584 INFO L78 Accepts]: Start accepts. Automaton has 178752 states and 215903 transitions. Word has length 652 [2019-10-02 01:13:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:13:20,585 INFO L475 AbstractCegarLoop]: Abstraction has 178752 states and 215903 transitions. [2019-10-02 01:13:20,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 01:13:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 178752 states and 215903 transitions. [2019-10-02 01:13:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-10-02 01:13:20,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:13:20,902 INFO L411 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10-02 01:13:20,902 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:13:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:13:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash 181635379, now seen corresponding path program 1 times [2019-10-02 01:13:20,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:13:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:13:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1823 backedges. 1156 proven. 429 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-10-02 01:13:24,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:13:24,894 INFO L224 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-10-02 01:13:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:25,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 01:13:25,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:13:25,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:13:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:25,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,557 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-10-02 01:13:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 01:13:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:13:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:13:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:13:26,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:13:26,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:13:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1823 backedges. 1240 proven. 57 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-02 01:13:28,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:13:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 35 [2019-10-02 01:13:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 01:13:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 01:13:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 01:13:28,214 INFO L87 Difference]: Start difference. First operand 178752 states and 215903 transitions. Second operand 35 states. [2019-10-02 01:13:33,897 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 01:13:41,673 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-10-02 01:13:43,550 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-02 01:13:43,912 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-02 01:13:46,794 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-02 01:13:49,492 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-02 01:13:49,919 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-10-02 01:13:50,789 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-10-02 01:13:51,006 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-02 01:13:52,411 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-02 01:13:57,851 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2019-10-02 01:13:58,271 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-02 01:14:01,996 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-02 01:14:04,657 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-02 01:14:06,121 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-10-02 01:14:09,638 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-10-02 01:14:10,898 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-02 01:14:11,966 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-10-02 01:14:12,639 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-02 01:14:13,673 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-10-02 01:14:16,240 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-10-02 01:14:20,375 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-10-02 01:14:20,524 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-10-02 01:14:21,986 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2019-10-02 01:14:22,592 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-10-02 01:14:22,903 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-10-02 01:14:28,334 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-10-02 01:14:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:14:32,606 INFO L93 Difference]: Finished difference Result 419118 states and 507811 transitions. [2019-10-02 01:14:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-10-02 01:14:32,606 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 807 [2019-10-02 01:14:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:14:33,498 INFO L225 Difference]: With dead ends: 419118 [2019-10-02 01:14:33,498 INFO L226 Difference]: Without dead ends: 254466 [2019-10-02 01:14:33,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 915 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16058 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=5847, Invalid=36794, Unknown=1, NotChecked=0, Total=42642 [2019-10-02 01:14:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254466 states. [2019-10-02 01:14:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254466 to 218708. [2019-10-02 01:14:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218708 states. [2019-10-02 01:14:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218708 states to 218708 states and 261847 transitions. [2019-10-02 01:14:40,332 INFO L78 Accepts]: Start accepts. Automaton has 218708 states and 261847 transitions. Word has length 807 [2019-10-02 01:14:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:14:40,333 INFO L475 AbstractCegarLoop]: Abstraction has 218708 states and 261847 transitions. [2019-10-02 01:14:40,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 01:14:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 218708 states and 261847 transitions. [2019-10-02 01:14:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2019-10-02 01:14:40,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:14:40,718 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2019-10-02 01:14:40,718 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:14:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:14:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1799566760, now seen corresponding path program 1 times [2019-10-02 01:14:40,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:14:40,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:14:40,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:14:40,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:14:40,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:14:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:14:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 1221 proven. 652 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2019-10-02 01:14:46,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:14:46,472 INFO L224 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-10-02 01:14:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:14:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:14:46,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:14:46,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:14:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:14:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 1488 proven. 2 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-10-02 01:14:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:14:47,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-10-02 01:14:47,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:14:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:14:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:14:47,256 INFO L87 Difference]: Start difference. First operand 218708 states and 261847 transitions. Second operand 18 states. [2019-10-02 01:15:23,180 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-10-02 01:15:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:15:31,275 INFO L93 Difference]: Finished difference Result 442290 states and 566844 transitions. [2019-10-02 01:15:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-10-02 01:15:31,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 816 [2019-10-02 01:15:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:15:32,250 INFO L225 Difference]: With dead ends: 442290 [2019-10-02 01:15:32,250 INFO L226 Difference]: Without dead ends: 228408 [2019-10-02 01:15:32,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15528 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4290, Invalid=32382, Unknown=0, NotChecked=0, Total=36672 [2019-10-02 01:15:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228408 states. [2019-10-02 01:15:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228408 to 199728. [2019-10-02 01:15:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199728 states. [2019-10-02 01:15:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199728 states to 199728 states and 231806 transitions. [2019-10-02 01:15:39,178 INFO L78 Accepts]: Start accepts. Automaton has 199728 states and 231806 transitions. Word has length 816 [2019-10-02 01:15:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:15:39,179 INFO L475 AbstractCegarLoop]: Abstraction has 199728 states and 231806 transitions. [2019-10-02 01:15:39,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:15:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 199728 states and 231806 transitions. [2019-10-02 01:15:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2019-10-02 01:15:39,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:15:39,416 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:15:39,417 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:15:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:15:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1978686442, now seen corresponding path program 1 times [2019-10-02 01:15:39,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:15:39,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:15:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:39,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1230 proven. 816 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-10-02 01:15:44,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:15:44,759 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:15:44,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:45,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 01:15:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:15:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:15:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:15:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:15:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:15:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:15:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1334 proven. 472 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-10-02 01:15:46,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:15:46,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 31 [2019-10-02 01:15:46,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 01:15:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 01:15:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:15:46,703 INFO L87 Difference]: Start difference. First operand 199728 states and 231806 transitions. Second operand 31 states. [2019-10-02 01:16:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:16:43,355 INFO L93 Difference]: Finished difference Result 418549 states and 487910 transitions. [2019-10-02 01:16:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2019-10-02 01:16:43,356 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 892 [2019-10-02 01:16:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:16:43,357 INFO L225 Difference]: With dead ends: 418549 [2019-10-02 01:16:43,357 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:16:43,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1325 GetRequests, 1054 SyntacticMatches, 3 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29515 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=7907, Invalid=64723, Unknown=0, NotChecked=0, Total=72630 [2019-10-02 01:16:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:16:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:16:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:16:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:16:43,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 892 [2019-10-02 01:16:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:16:43,841 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:16:43,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 01:16:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:16:43,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:16:43,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.