java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:55:22,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:55:22,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:55:22,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:55:22,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:55:22,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:55:22,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:55:22,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:55:22,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:55:22,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:55:22,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:55:22,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:55:22,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:55:22,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:55:22,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:55:22,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:55:22,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:55:22,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:55:22,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:55:22,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:55:22,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:55:22,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:55:22,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:55:22,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:55:22,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:55:22,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:55:22,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:55:22,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:55:22,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:55:22,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:55:22,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:55:22,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:55:22,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:55:22,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:55:22,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:55:22,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:55:22,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:55:22,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:55:22,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:55:22,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:55:22,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:55:22,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:55:22,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:55:22,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:55:22,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:55:22,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:55:22,719 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:55:22,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:55:22,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:55:22,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:55:22,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:55:22,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:55:22,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:55:22,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:55:22,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:55:22,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:55:22,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:55:22,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:55:22,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:55:22,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:55:22,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:55:22,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:55:22,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:55:22,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:55:22,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:55:22,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:55:22,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:55:22,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:55:22,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:55:22,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:55:22,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:55:22,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:55:22,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:55:22,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:55:22,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:55:22,766 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:55:22,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label03.c [2019-09-07 20:55:22,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2383df021/012eadf9404240b1a5a3b4adb1078dfc/FLAG11cdb0261 [2019-09-07 20:55:23,431 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:55:23,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label03.c [2019-09-07 20:55:23,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2383df021/012eadf9404240b1a5a3b4adb1078dfc/FLAG11cdb0261 [2019-09-07 20:55:23,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2383df021/012eadf9404240b1a5a3b4adb1078dfc [2019-09-07 20:55:23,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:55:23,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:55:23,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:55:23,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:55:23,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:55:23,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:55:23" (1/1) ... [2019-09-07 20:55:23,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322c079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:23, skipping insertion in model container [2019-09-07 20:55:23,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:55:23" (1/1) ... [2019-09-07 20:55:23,621 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:55:23,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:55:24,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:55:24,471 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:55:24,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:55:24,984 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:55:24,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24 WrapperNode [2019-09-07 20:55:24,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:55:24,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:55:24,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:55:24,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:55:25,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... [2019-09-07 20:55:25,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:55:25,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:55:25,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:55:25,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:55:25,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:55:25,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:55:25,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:55:25,227 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:55:25,228 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:55:25,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:55:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:55:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:55:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:55:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:55:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:55:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:55:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:55:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:55:27,995 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:55:27,995 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:55:27,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:55:27 BoogieIcfgContainer [2019-09-07 20:55:27,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:55:27,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:55:27,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:55:28,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:55:28,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:55:23" (1/3) ... [2019-09-07 20:55:28,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adca007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:55:28, skipping insertion in model container [2019-09-07 20:55:28,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:55:24" (2/3) ... [2019-09-07 20:55:28,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adca007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:55:28, skipping insertion in model container [2019-09-07 20:55:28,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:55:27" (3/3) ... [2019-09-07 20:55:28,005 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label03.c [2019-09-07 20:55:28,017 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:55:28,026 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:55:28,046 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:55:28,095 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:55:28,097 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:55:28,097 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:55:28,097 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:55:28,097 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:55:28,097 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:55:28,098 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:55:28,098 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:55:28,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:55:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 20:55:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-07 20:55:28,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:28,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:28,151 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1120650517, now seen corresponding path program 1 times [2019-09-07 20:55:28,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:28,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:28,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:28,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:55:28,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:55:28,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:55:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:55:28,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:55:28,425 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 20:55:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:31,329 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 20:55:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:55:31,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-07 20:55:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:31,353 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 20:55:31,353 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 20:55:31,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-07 20:55:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 20:55:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 20:55:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 20:55:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1172 transitions. [2019-09-07 20:55:31,465 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1172 transitions. Word has length 12 [2019-09-07 20:55:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:31,466 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1172 transitions. [2019-09-07 20:55:31,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:55:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1172 transitions. [2019-09-07 20:55:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 20:55:31,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:31,471 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:31,471 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 936875984, now seen corresponding path program 1 times [2019-09-07 20:55:31,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:31,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:31,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:55:31,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:55:31,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:55:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:55:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:55:31,783 INFO L87 Difference]: Start difference. First operand 682 states and 1172 transitions. Second operand 6 states. [2019-09-07 20:55:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:36,588 INFO L93 Difference]: Finished difference Result 2074 states and 3595 transitions. [2019-09-07 20:55:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:55:36,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-07 20:55:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:36,601 INFO L225 Difference]: With dead ends: 2074 [2019-09-07 20:55:36,601 INFO L226 Difference]: Without dead ends: 1398 [2019-09-07 20:55:36,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:55:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-09-07 20:55:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1382. [2019-09-07 20:55:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-07 20:55:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2347 transitions. [2019-09-07 20:55:36,665 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2347 transitions. Word has length 84 [2019-09-07 20:55:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:36,666 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2347 transitions. [2019-09-07 20:55:36,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:55:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2347 transitions. [2019-09-07 20:55:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 20:55:36,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:36,670 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:36,671 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2128606377, now seen corresponding path program 1 times [2019-09-07 20:55:36,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:36,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:36,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:55:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:55:36,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:55:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:55:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:55:36,827 INFO L87 Difference]: Start difference. First operand 1382 states and 2347 transitions. Second operand 6 states. [2019-09-07 20:55:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:39,392 INFO L93 Difference]: Finished difference Result 3496 states and 6019 transitions. [2019-09-07 20:55:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:55:39,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-09-07 20:55:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:39,409 INFO L225 Difference]: With dead ends: 3496 [2019-09-07 20:55:39,409 INFO L226 Difference]: Without dead ends: 2120 [2019-09-07 20:55:39,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:55:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-09-07 20:55:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2088. [2019-09-07 20:55:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-07 20:55:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3356 transitions. [2019-09-07 20:55:39,499 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3356 transitions. Word has length 113 [2019-09-07 20:55:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:39,509 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 3356 transitions. [2019-09-07 20:55:39,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:55:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3356 transitions. [2019-09-07 20:55:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 20:55:39,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:39,516 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:39,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash 333501888, now seen corresponding path program 1 times [2019-09-07 20:55:39,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:39,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:39,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:39,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:55:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:55:39,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:55:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:55:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:55:39,752 INFO L87 Difference]: Start difference. First operand 2088 states and 3356 transitions. Second operand 6 states. [2019-09-07 20:55:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:42,162 INFO L93 Difference]: Finished difference Result 5237 states and 8467 transitions. [2019-09-07 20:55:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:55:42,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-07 20:55:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:42,183 INFO L225 Difference]: With dead ends: 5237 [2019-09-07 20:55:42,184 INFO L226 Difference]: Without dead ends: 3155 [2019-09-07 20:55:42,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:55:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2019-09-07 20:55:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3138. [2019-09-07 20:55:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-09-07 20:55:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4881 transitions. [2019-09-07 20:55:42,266 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4881 transitions. Word has length 156 [2019-09-07 20:55:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:42,266 INFO L475 AbstractCegarLoop]: Abstraction has 3138 states and 4881 transitions. [2019-09-07 20:55:42,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:55:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4881 transitions. [2019-09-07 20:55:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 20:55:42,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:42,271 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:42,271 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash -751206508, now seen corresponding path program 1 times [2019-09-07 20:55:42,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:42,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:55:42,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:55:42,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:55:42,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:42,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:55:42,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:55:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:55:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:55:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:55:42,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:55:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:55:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:55:42,697 INFO L87 Difference]: Start difference. First operand 3138 states and 4881 transitions. Second operand 8 states. [2019-09-07 20:55:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:45,965 INFO L93 Difference]: Finished difference Result 7369 states and 11767 transitions. [2019-09-07 20:55:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:55:45,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 225 [2019-09-07 20:55:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:45,990 INFO L225 Difference]: With dead ends: 7369 [2019-09-07 20:55:45,991 INFO L226 Difference]: Without dead ends: 4237 [2019-09-07 20:55:45,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:55:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2019-09-07 20:55:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 4175. [2019-09-07 20:55:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4175 states. [2019-09-07 20:55:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 5958 transitions. [2019-09-07 20:55:46,113 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 5958 transitions. Word has length 225 [2019-09-07 20:55:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:46,114 INFO L475 AbstractCegarLoop]: Abstraction has 4175 states and 5958 transitions. [2019-09-07 20:55:46,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:55:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 5958 transitions. [2019-09-07 20:55:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 20:55:46,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:46,118 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:46,118 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 85011109, now seen corresponding path program 1 times [2019-09-07 20:55:46,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:46,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:55:46,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:55:46,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:55:46,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:55:46,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:55:46,452 INFO L87 Difference]: Start difference. First operand 4175 states and 5958 transitions. Second operand 6 states. [2019-09-07 20:55:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:49,669 INFO L93 Difference]: Finished difference Result 10777 states and 15550 transitions. [2019-09-07 20:55:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:55:49,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-09-07 20:55:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:49,698 INFO L225 Difference]: With dead ends: 10777 [2019-09-07 20:55:49,698 INFO L226 Difference]: Without dead ends: 6608 [2019-09-07 20:55:49,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:55:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2019-09-07 20:55:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 5220. [2019-09-07 20:55:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-09-07 20:55:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6886 transitions. [2019-09-07 20:55:49,835 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6886 transitions. Word has length 227 [2019-09-07 20:55:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:49,837 INFO L475 AbstractCegarLoop]: Abstraction has 5220 states and 6886 transitions. [2019-09-07 20:55:49,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:55:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6886 transitions. [2019-09-07 20:55:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-07 20:55:49,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:49,844 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:49,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1322245899, now seen corresponding path program 1 times [2019-09-07 20:55:49,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 20:55:50,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:55:50,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:55:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:50,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:55:50,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:55:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:55:50,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:55:50,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 20:55:50,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:55:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:55:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:55:50,421 INFO L87 Difference]: Start difference. First operand 5220 states and 6886 transitions. Second operand 5 states. [2019-09-07 20:55:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:53,147 INFO L93 Difference]: Finished difference Result 15254 states and 20532 transitions. [2019-09-07 20:55:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:55:53,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-09-07 20:55:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:53,199 INFO L225 Difference]: With dead ends: 15254 [2019-09-07 20:55:53,200 INFO L226 Difference]: Without dead ends: 10040 [2019-09-07 20:55:53,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:55:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-09-07 20:55:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 9336. [2019-09-07 20:55:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9336 states. [2019-09-07 20:55:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 12602 transitions. [2019-09-07 20:55:53,523 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 12602 transitions. Word has length 251 [2019-09-07 20:55:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:53,524 INFO L475 AbstractCegarLoop]: Abstraction has 9336 states and 12602 transitions. [2019-09-07 20:55:53,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:55:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 12602 transitions. [2019-09-07 20:55:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 20:55:53,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:53,536 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:53,536 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash -222087006, now seen corresponding path program 1 times [2019-09-07 20:55:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:53,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:55:53,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:55:53,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:55:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:55:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:53,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:55:53,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:55:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 20:55:54,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:55:54,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:55:54,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:55:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:55:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:55:54,042 INFO L87 Difference]: Start difference. First operand 9336 states and 12602 transitions. Second operand 9 states. [2019-09-07 20:55:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:57,996 INFO L93 Difference]: Finished difference Result 23506 states and 32156 transitions. [2019-09-07 20:55:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:55:57,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-07 20:55:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:58,042 INFO L225 Difference]: With dead ends: 23506 [2019-09-07 20:55:58,042 INFO L226 Difference]: Without dead ends: 14176 [2019-09-07 20:55:58,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:55:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14176 states. [2019-09-07 20:55:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14176 to 14150. [2019-09-07 20:55:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-09-07 20:55:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 18354 transitions. [2019-09-07 20:55:58,419 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 18354 transitions. Word has length 327 [2019-09-07 20:55:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:58,419 INFO L475 AbstractCegarLoop]: Abstraction has 14150 states and 18354 transitions. [2019-09-07 20:55:58,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:55:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 18354 transitions. [2019-09-07 20:55:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-07 20:55:58,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:58,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:55:58,431 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 947541421, now seen corresponding path program 1 times [2019-09-07 20:55:58,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:58,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:58,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:59,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:55:59,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:55:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:59,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:55:59,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:55:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:55:59,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:55:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 20:55:59,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:55:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:55:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:55:59,708 INFO L87 Difference]: Start difference. First operand 14150 states and 18354 transitions. Second operand 15 states. [2019-09-07 20:56:09,065 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-09-07 20:56:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:10,146 INFO L93 Difference]: Finished difference Result 33647 states and 43099 transitions. [2019-09-07 20:56:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 20:56:10,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 342 [2019-09-07 20:56:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:10,202 INFO L225 Difference]: With dead ends: 33647 [2019-09-07 20:56:10,202 INFO L226 Difference]: Without dead ends: 17492 [2019-09-07 20:56:10,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=547, Invalid=2003, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:56:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17492 states. [2019-09-07 20:56:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17492 to 17426. [2019-09-07 20:56:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17426 states. [2019-09-07 20:56:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17426 states to 17426 states and 19249 transitions. [2019-09-07 20:56:10,504 INFO L78 Accepts]: Start accepts. Automaton has 17426 states and 19249 transitions. Word has length 342 [2019-09-07 20:56:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:10,504 INFO L475 AbstractCegarLoop]: Abstraction has 17426 states and 19249 transitions. [2019-09-07 20:56:10,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:56:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17426 states and 19249 transitions. [2019-09-07 20:56:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-07 20:56:10,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:10,518 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:56:10,519 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2114902651, now seen corresponding path program 1 times [2019-09-07 20:56:10,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:10,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 126 proven. 196 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-07 20:56:11,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:11,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:11,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:11,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:56:11,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:56:11,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:56:11,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-07 20:56:11,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:56:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:56:11,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:56:11,771 INFO L87 Difference]: Start difference. First operand 17426 states and 19249 transitions. Second operand 10 states. [2019-09-07 20:56:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:16,933 INFO L93 Difference]: Finished difference Result 35865 states and 39598 transitions. [2019-09-07 20:56:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:56:16,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 454 [2019-09-07 20:56:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:16,965 INFO L225 Difference]: With dead ends: 35865 [2019-09-07 20:56:16,965 INFO L226 Difference]: Without dead ends: 18449 [2019-09-07 20:56:16,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:56:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2019-09-07 20:56:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 17424. [2019-09-07 20:56:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17424 states. [2019-09-07 20:56:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 18959 transitions. [2019-09-07 20:56:17,245 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 18959 transitions. Word has length 454 [2019-09-07 20:56:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:17,245 INFO L475 AbstractCegarLoop]: Abstraction has 17424 states and 18959 transitions. [2019-09-07 20:56:17,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:56:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 18959 transitions. [2019-09-07 20:56:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-07 20:56:17,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:17,267 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:56:17,268 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -192559155, now seen corresponding path program 1 times [2019-09-07 20:56:17,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:17,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:17,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 20:56:18,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:18,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:18,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:56:18,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 20:56:18,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:56:18,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:56:18,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:56:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:56:18,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:56:18,561 INFO L87 Difference]: Start difference. First operand 17424 states and 18959 transitions. Second operand 9 states. [2019-09-07 20:56:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:23,539 INFO L93 Difference]: Finished difference Result 36500 states and 40892 transitions. [2019-09-07 20:56:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:56:23,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 569 [2019-09-07 20:56:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:23,587 INFO L225 Difference]: With dead ends: 36500 [2019-09-07 20:56:23,588 INFO L226 Difference]: Without dead ends: 19086 [2019-09-07 20:56:23,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:56:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2019-09-07 20:56:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 16976. [2019-09-07 20:56:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16976 states. [2019-09-07 20:56:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16976 states to 16976 states and 18887 transitions. [2019-09-07 20:56:23,952 INFO L78 Accepts]: Start accepts. Automaton has 16976 states and 18887 transitions. Word has length 569 [2019-09-07 20:56:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:23,956 INFO L475 AbstractCegarLoop]: Abstraction has 16976 states and 18887 transitions. [2019-09-07 20:56:23,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:56:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16976 states and 18887 transitions. [2019-09-07 20:56:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-07 20:56:24,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:24,080 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:56:24,080 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -64453763, now seen corresponding path program 1 times [2019-09-07 20:56:24,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:24,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:24,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 343 proven. 53 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 20:56:24,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:24,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:24,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:24,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:56:24,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 20:56:25,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:56:25,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:56:25,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:56:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:56:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:56:25,052 INFO L87 Difference]: Start difference. First operand 16976 states and 18887 transitions. Second operand 9 states. [2019-09-07 20:56:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:28,114 INFO L93 Difference]: Finished difference Result 34719 states and 40017 transitions. [2019-09-07 20:56:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:56:28,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 593 [2019-09-07 20:56:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:28,173 INFO L225 Difference]: With dead ends: 34719 [2019-09-07 20:56:28,174 INFO L226 Difference]: Without dead ends: 19775 [2019-09-07 20:56:28,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:56:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19775 states. [2019-09-07 20:56:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19775 to 17311. [2019-09-07 20:56:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17311 states. [2019-09-07 20:56:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17311 states to 17311 states and 19029 transitions. [2019-09-07 20:56:28,568 INFO L78 Accepts]: Start accepts. Automaton has 17311 states and 19029 transitions. Word has length 593 [2019-09-07 20:56:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:28,570 INFO L475 AbstractCegarLoop]: Abstraction has 17311 states and 19029 transitions. [2019-09-07 20:56:28,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:56:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17311 states and 19029 transitions. [2019-09-07 20:56:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-09-07 20:56:28,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:28,601 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:56:28,602 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1244924613, now seen corresponding path program 1 times [2019-09-07 20:56:28,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:28,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:28,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:28,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:28,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 150 proven. 293 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-09-07 20:56:29,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:29,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:56:29,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:29,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:56:29,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 814 proven. 2 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 20:56:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:56:30,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:56:30,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:56:30,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:56:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:56:30,139 INFO L87 Difference]: Start difference. First operand 17311 states and 19029 transitions. Second operand 9 states. [2019-09-07 20:56:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:33,116 INFO L93 Difference]: Finished difference Result 32633 states and 36055 transitions. [2019-09-07 20:56:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:56:33,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 773 [2019-09-07 20:56:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:33,153 INFO L225 Difference]: With dead ends: 32633 [2019-09-07 20:56:33,154 INFO L226 Difference]: Without dead ends: 17354 [2019-09-07 20:56:33,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:56:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-09-07 20:56:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 15928. [2019-09-07 20:56:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15928 states. [2019-09-07 20:56:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15928 states to 15928 states and 17125 transitions. [2019-09-07 20:56:33,410 INFO L78 Accepts]: Start accepts. Automaton has 15928 states and 17125 transitions. Word has length 773 [2019-09-07 20:56:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:33,411 INFO L475 AbstractCegarLoop]: Abstraction has 15928 states and 17125 transitions. [2019-09-07 20:56:33,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:56:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15928 states and 17125 transitions. [2019-09-07 20:56:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2019-09-07 20:56:33,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:33,456 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:56:33,456 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1972942641, now seen corresponding path program 1 times [2019-09-07 20:56:33,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:33,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:33,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 477 proven. 2 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2019-09-07 20:56:34,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:34,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:34,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:56:34,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 477 proven. 2 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2019-09-07 20:56:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:56:35,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:56:35,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:56:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:56:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:56:35,568 INFO L87 Difference]: Start difference. First operand 15928 states and 17125 transitions. Second operand 9 states. [2019-09-07 20:56:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:39,701 INFO L93 Difference]: Finished difference Result 31843 states and 34238 transitions. [2019-09-07 20:56:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:56:39,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1013 [2019-09-07 20:56:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:39,734 INFO L225 Difference]: With dead ends: 31843 [2019-09-07 20:56:39,734 INFO L226 Difference]: Without dead ends: 15925 [2019-09-07 20:56:39,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1017 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:56:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15925 states. [2019-09-07 20:56:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15925 to 15209. [2019-09-07 20:56:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15209 states. [2019-09-07 20:56:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15209 states to 15209 states and 15914 transitions. [2019-09-07 20:56:39,987 INFO L78 Accepts]: Start accepts. Automaton has 15209 states and 15914 transitions. Word has length 1013 [2019-09-07 20:56:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:39,988 INFO L475 AbstractCegarLoop]: Abstraction has 15209 states and 15914 transitions. [2019-09-07 20:56:39,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:56:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15209 states and 15914 transitions. [2019-09-07 20:56:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-09-07 20:56:40,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:40,021 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:56:40,021 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash 702612678, now seen corresponding path program 1 times [2019-09-07 20:56:40,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:40,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:40,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:40,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 281 proven. 477 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2019-09-07 20:56:41,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:41,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:41,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:56:41,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2019-09-07 20:56:41,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:56:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 20:56:41,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:56:41,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:56:41,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:56:41,782 INFO L87 Difference]: Start difference. First operand 15209 states and 15914 transitions. Second operand 8 states. [2019-09-07 20:56:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:56:45,108 INFO L93 Difference]: Finished difference Result 35419 states and 37536 transitions. [2019-09-07 20:56:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:56:45,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1028 [2019-09-07 20:56:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:56:45,154 INFO L225 Difference]: With dead ends: 35419 [2019-09-07 20:56:45,154 INFO L226 Difference]: Without dead ends: 21568 [2019-09-07 20:56:45,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1047 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:56:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21568 states. [2019-09-07 20:56:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21568 to 17850. [2019-09-07 20:56:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17850 states. [2019-09-07 20:56:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 18422 transitions. [2019-09-07 20:56:45,471 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 18422 transitions. Word has length 1028 [2019-09-07 20:56:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:56:45,472 INFO L475 AbstractCegarLoop]: Abstraction has 17850 states and 18422 transitions. [2019-09-07 20:56:45,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:56:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 18422 transitions. [2019-09-07 20:56:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2019-09-07 20:56:45,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:56:45,504 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:56:45,504 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:56:45,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:56:45,504 INFO L82 PathProgramCache]: Analyzing trace with hash -245659582, now seen corresponding path program 1 times [2019-09-07 20:56:45,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:56:45,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:56:45,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:45,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:56:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3446 backedges. 1696 proven. 497 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-09-07 20:56:49,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:56:49,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:56:49,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:56:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:56:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 20:56:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:56:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:56:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3446 backedges. 1832 proven. 5 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2019-09-07 20:56:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:56:50,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-09-07 20:56:50,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:56:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:56:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:56:50,780 INFO L87 Difference]: Start difference. First operand 17850 states and 18422 transitions. Second operand 20 states. [2019-09-07 20:56:53,073 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 20:56:56,617 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 20:56:57,118 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-07 20:56:57,572 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 20:56:58,024 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-07 20:56:58,244 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 20:56:58,970 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-07 20:56:59,305 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-07 20:57:01,520 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-07 20:57:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:02,228 INFO L93 Difference]: Finished difference Result 36101 states and 37348 transitions. [2019-09-07 20:57:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:57:02,229 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1301 [2019-09-07 20:57:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:02,254 INFO L225 Difference]: With dead ends: 36101 [2019-09-07 20:57:02,254 INFO L226 Difference]: Without dead ends: 18596 [2019-09-07 20:57:02,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1386 GetRequests, 1331 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=566, Invalid=2626, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 20:57:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18596 states. [2019-09-07 20:57:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18596 to 18189. [2019-09-07 20:57:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18189 states. [2019-09-07 20:57:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18189 states to 18189 states and 18715 transitions. [2019-09-07 20:57:02,508 INFO L78 Accepts]: Start accepts. Automaton has 18189 states and 18715 transitions. Word has length 1301 [2019-09-07 20:57:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:02,509 INFO L475 AbstractCegarLoop]: Abstraction has 18189 states and 18715 transitions. [2019-09-07 20:57:02,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:57:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18189 states and 18715 transitions. [2019-09-07 20:57:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1437 [2019-09-07 20:57:02,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:02,544 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:02,544 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash -559937949, now seen corresponding path program 1 times [2019-09-07 20:57:02,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:02,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:02,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:02,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 820 proven. 422 refuted. 0 times theorem prover too weak. 2511 trivial. 0 not checked. [2019-09-07 20:57:05,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:05,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:57:05,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:06,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:57:06,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 3692 trivial. 0 not checked. [2019-09-07 20:57:06,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:57:06,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 20:57:06,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:06,978 INFO L87 Difference]: Start difference. First operand 18189 states and 18715 transitions. Second operand 9 states. [2019-09-07 20:57:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:10,939 INFO L93 Difference]: Finished difference Result 37419 states and 38551 transitions. [2019-09-07 20:57:10,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:57:10,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1436 [2019-09-07 20:57:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:10,975 INFO L225 Difference]: With dead ends: 37419 [2019-09-07 20:57:10,975 INFO L226 Difference]: Without dead ends: 19573 [2019-09-07 20:57:10,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1475 GetRequests, 1452 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:57:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19573 states. [2019-09-07 20:57:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19573 to 16494. [2019-09-07 20:57:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16494 states. [2019-09-07 20:57:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16494 states to 16494 states and 16855 transitions. [2019-09-07 20:57:11,230 INFO L78 Accepts]: Start accepts. Automaton has 16494 states and 16855 transitions. Word has length 1436 [2019-09-07 20:57:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:11,231 INFO L475 AbstractCegarLoop]: Abstraction has 16494 states and 16855 transitions. [2019-09-07 20:57:11,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16494 states and 16855 transitions. [2019-09-07 20:57:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1899 [2019-09-07 20:57:11,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:11,273 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:11,273 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1683383265, now seen corresponding path program 1 times [2019-09-07 20:57:11,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:11,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6124 backedges. 1566 proven. 1399 refuted. 0 times theorem prover too weak. 3159 trivial. 0 not checked. [2019-09-07 20:57:17,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:17,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:57:17,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:18,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 20:57:18,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:57:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6124 backedges. 2536 proven. 2 refuted. 0 times theorem prover too weak. 3586 trivial. 0 not checked. [2019-09-07 20:57:19,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:19,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-09-07 20:57:19,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:57:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:57:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:57:19,766 INFO L87 Difference]: Start difference. First operand 16494 states and 16855 transitions. Second operand 20 states. [2019-09-07 20:57:29,959 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-07 20:57:30,565 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 20:57:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:30,909 INFO L93 Difference]: Finished difference Result 34675 states and 35439 transitions. [2019-09-07 20:57:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 20:57:30,910 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1898 [2019-09-07 20:57:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:30,932 INFO L225 Difference]: With dead ends: 34675 [2019-09-07 20:57:30,932 INFO L226 Difference]: Without dead ends: 18865 [2019-09-07 20:57:30,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1971 GetRequests, 1917 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 20:57:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18865 states. [2019-09-07 20:57:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18865 to 17172. [2019-09-07 20:57:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17172 states. [2019-09-07 20:57:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17172 states to 17172 states and 17540 transitions. [2019-09-07 20:57:31,131 INFO L78 Accepts]: Start accepts. Automaton has 17172 states and 17540 transitions. Word has length 1898 [2019-09-07 20:57:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:31,131 INFO L475 AbstractCegarLoop]: Abstraction has 17172 states and 17540 transitions. [2019-09-07 20:57:31,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:57:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17172 states and 17540 transitions. [2019-09-07 20:57:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1988 [2019-09-07 20:57:31,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:31,171 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:31,171 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 325379238, now seen corresponding path program 1 times [2019-09-07 20:57:31,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:31,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6457 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 6377 trivial. 0 not checked. [2019-09-07 20:57:33,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:57:33,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:57:33,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:57:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:57:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:57:33,709 INFO L87 Difference]: Start difference. First operand 17172 states and 17540 transitions. Second operand 3 states. [2019-09-07 20:57:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:34,929 INFO L93 Difference]: Finished difference Result 35008 states and 35794 transitions. [2019-09-07 20:57:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:57:34,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1987 [2019-09-07 20:57:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:34,964 INFO L225 Difference]: With dead ends: 35008 [2019-09-07 20:57:34,964 INFO L226 Difference]: Without dead ends: 18515 [2019-09-07 20:57:34,980 INFO L628 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-09-07 20:57:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18515 states. [2019-09-07 20:57:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18515 to 16828. [2019-09-07 20:57:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16828 states. [2019-09-07 20:57:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16828 states to 16828 states and 17167 transitions. [2019-09-07 20:57:35,177 INFO L78 Accepts]: Start accepts. Automaton has 16828 states and 17167 transitions. Word has length 1987 [2019-09-07 20:57:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:35,179 INFO L475 AbstractCegarLoop]: Abstraction has 16828 states and 17167 transitions. [2019-09-07 20:57:35,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:57:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 16828 states and 17167 transitions. [2019-09-07 20:57:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2132 [2019-09-07 20:57:35,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:35,228 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:35,228 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1323853586, now seen corresponding path program 1 times [2019-09-07 20:57:35,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 1112 proven. 5433 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2019-09-07 20:57:43,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:43,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:57:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:43,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 2727 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:57:43,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:57:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 4852 proven. 2 refuted. 0 times theorem prover too weak. 3720 trivial. 0 not checked. [2019-09-07 20:57:45,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:45,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 29 [2019-09-07 20:57:45,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 20:57:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 20:57:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2019-09-07 20:57:45,224 INFO L87 Difference]: Start difference. First operand 16828 states and 17167 transitions. Second operand 29 states. [2019-09-07 20:57:53,200 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-07 20:58:07,477 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 20:58:14,313 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 20:58:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:18,980 INFO L93 Difference]: Finished difference Result 38731 states and 39583 transitions. [2019-09-07 20:58:18,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-07 20:58:18,980 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 2131 [2019-09-07 20:58:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:19,008 INFO L225 Difference]: With dead ends: 38731 [2019-09-07 20:58:19,008 INFO L226 Difference]: Without dead ends: 22924 [2019-09-07 20:58:19,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2339 GetRequests, 2211 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6209 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2237, Invalid=14275, Unknown=0, NotChecked=0, Total=16512 [2019-09-07 20:58:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22924 states. [2019-09-07 20:58:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22924 to 20235. [2019-09-07 20:58:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20235 states. [2019-09-07 20:58:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20235 states to 20235 states and 20569 transitions. [2019-09-07 20:58:19,222 INFO L78 Accepts]: Start accepts. Automaton has 20235 states and 20569 transitions. Word has length 2131 [2019-09-07 20:58:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:19,222 INFO L475 AbstractCegarLoop]: Abstraction has 20235 states and 20569 transitions. [2019-09-07 20:58:19,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 20:58:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 20235 states and 20569 transitions. [2019-09-07 20:58:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2193 [2019-09-07 20:58:19,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:19,259 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:58:19,260 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1169986842, now seen corresponding path program 1 times [2019-09-07 20:58:19,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:19,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10016 backedges. 2300 proven. 2056 refuted. 0 times theorem prover too weak. 5660 trivial. 0 not checked. [2019-09-07 20:58:27,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:27,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:58:27,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:27,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 20:58:27,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:27,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:58:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10016 backedges. 6747 proven. 6 refuted. 0 times theorem prover too weak. 3263 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:58:29,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:58:29,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 20:58:29,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 20:58:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 20:58:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:58:29,407 INFO L87 Difference]: Start difference. First operand 20235 states and 20569 transitions. Second operand 21 states. [2019-09-07 20:58:41,174 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-07 20:58:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:42,062 INFO L93 Difference]: Finished difference Result 39533 states and 40283 transitions. [2019-09-07 20:58:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 20:58:42,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2192 [2019-09-07 20:58:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:42,092 INFO L225 Difference]: With dead ends: 39533 [2019-09-07 20:58:42,092 INFO L226 Difference]: Without dead ends: 20319 [2019-09-07 20:58:42,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2302 GetRequests, 2232 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=887, Invalid=4225, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 20:58:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20319 states. [2019-09-07 20:58:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20319 to 20235. [2019-09-07 20:58:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20235 states. [2019-09-07 20:58:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20235 states to 20235 states and 20563 transitions. [2019-09-07 20:58:42,279 INFO L78 Accepts]: Start accepts. Automaton has 20235 states and 20563 transitions. Word has length 2192 [2019-09-07 20:58:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:42,280 INFO L475 AbstractCegarLoop]: Abstraction has 20235 states and 20563 transitions. [2019-09-07 20:58:42,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 20:58:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20235 states and 20563 transitions. [2019-09-07 20:58:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2257 [2019-09-07 20:58:42,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:42,317 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:58:42,318 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1414388744, now seen corresponding path program 1 times [2019-09-07 20:58:42,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:42,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9495 backedges. 1527 proven. 4544 refuted. 0 times theorem prover too weak. 3424 trivial. 0 not checked. [2019-09-07 20:58:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:52,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:58:52,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:52,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:58:52,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:53,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:58:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9495 backedges. 5299 proven. 2 refuted. 0 times theorem prover too weak. 4194 trivial. 0 not checked. [2019-09-07 20:58:54,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:58:54,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 20:58:54,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 20:58:54,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 20:58:54,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:58:54,752 INFO L87 Difference]: Start difference. First operand 20235 states and 20563 transitions. Second operand 24 states. [2019-09-07 20:59:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:59:15,220 INFO L93 Difference]: Finished difference Result 45618 states and 46518 transitions. [2019-09-07 20:59:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 20:59:15,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2256 [2019-09-07 20:59:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:59:15,267 INFO L225 Difference]: With dead ends: 45618 [2019-09-07 20:59:15,267 INFO L226 Difference]: Without dead ends: 26404 [2019-09-07 20:59:15,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2403 GetRequests, 2313 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1168, Invalid=6314, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 20:59:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26404 states. [2019-09-07 20:59:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26404 to 23969. [2019-09-07 20:59:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23969 states. [2019-09-07 20:59:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23969 states to 23969 states and 24379 transitions. [2019-09-07 20:59:15,534 INFO L78 Accepts]: Start accepts. Automaton has 23969 states and 24379 transitions. Word has length 2256 [2019-09-07 20:59:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:59:15,535 INFO L475 AbstractCegarLoop]: Abstraction has 23969 states and 24379 transitions. [2019-09-07 20:59:15,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 20:59:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23969 states and 24379 transitions. [2019-09-07 20:59:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2422 [2019-09-07 20:59:15,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:59:15,578 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:59:15,578 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:59:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:59:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash 833562247, now seen corresponding path program 1 times [2019-09-07 20:59:15,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:59:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:59:15,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:15,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:15,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 1891 proven. 5994 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2019-09-07 20:59:27,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:59:27,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:59:27,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:28,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:59:28,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:59:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:59:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:59:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 2966 proven. 2 refuted. 0 times theorem prover too weak. 7806 trivial. 0 not checked. [2019-09-07 20:59:31,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:59:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2019-09-07 20:59:31,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 20:59:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 20:59:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-09-07 20:59:31,242 INFO L87 Difference]: Start difference. First operand 23969 states and 24379 transitions. Second operand 31 states. [2019-09-07 20:59:52,825 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-07 20:59:58,066 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-07 20:59:58,247 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-07 20:59:59,389 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-07 21:00:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:00,073 INFO L93 Difference]: Finished difference Result 48327 states and 49269 transitions. [2019-09-07 21:00:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 21:00:00,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 2421 [2019-09-07 21:00:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:00,107 INFO L225 Difference]: With dead ends: 48327 [2019-09-07 21:00:00,107 INFO L226 Difference]: Without dead ends: 26061 [2019-09-07 21:00:00,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2589 GetRequests, 2475 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1674, Invalid=10982, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 21:00:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26061 states. [2019-09-07 21:00:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26061 to 23267. [2019-09-07 21:00:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23267 states. [2019-09-07 21:00:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23267 states to 23267 states and 23642 transitions. [2019-09-07 21:00:00,432 INFO L78 Accepts]: Start accepts. Automaton has 23267 states and 23642 transitions. Word has length 2421 [2019-09-07 21:00:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:00,434 INFO L475 AbstractCegarLoop]: Abstraction has 23267 states and 23642 transitions. [2019-09-07 21:00:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 21:00:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23267 states and 23642 transitions. [2019-09-07 21:00:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2019-09-07 21:00:00,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:00,491 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:00:00,491 INFO L418 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1844289483, now seen corresponding path program 1 times [2019-09-07 21:00:00,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:00,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13537 backedges. 1504 proven. 2289 refuted. 0 times theorem prover too weak. 9744 trivial. 0 not checked. [2019-09-07 21:00:06,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:06,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:00:06,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:06,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 3369 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:00:06,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:07,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:00:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13537 backedges. 9017 proven. 10 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2019-09-07 21:00:11,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:00:11,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:00:11,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:00:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:00:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-09-07 21:00:11,013 INFO L87 Difference]: Start difference. First operand 23267 states and 23642 transitions. Second operand 16 states. [2019-09-07 21:00:17,674 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-07 21:00:30,974 WARN L188 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-09-07 21:00:41,643 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-09-07 21:00:56,501 WARN L188 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-09-07 21:01:02,336 WARN L188 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2019-09-07 21:01:07,399 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-07 21:01:21,634 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-09-07 21:01:42,543 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 46 DAG size of output: 13 [2019-09-07 21:02:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:02:01,526 INFO L93 Difference]: Finished difference Result 51632 states and 52524 transitions. [2019-09-07 21:02:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 21:02:01,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2735 [2019-09-07 21:02:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:02:01,562 INFO L225 Difference]: With dead ends: 51632 [2019-09-07 21:02:01,562 INFO L226 Difference]: Without dead ends: 30403 [2019-09-07 21:02:01,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2828 GetRequests, 2762 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=721, Invalid=3292, Unknown=19, NotChecked=0, Total=4032 [2019-09-07 21:02:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30403 states. [2019-09-07 21:02:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30403 to 25653. [2019-09-07 21:02:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25653 states. [2019-09-07 21:02:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25653 states to 25653 states and 26066 transitions. [2019-09-07 21:02:01,815 INFO L78 Accepts]: Start accepts. Automaton has 25653 states and 26066 transitions. Word has length 2735 [2019-09-07 21:02:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:02:01,816 INFO L475 AbstractCegarLoop]: Abstraction has 25653 states and 26066 transitions. [2019-09-07 21:02:01,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:02:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25653 states and 26066 transitions. [2019-09-07 21:02:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2758 [2019-09-07 21:02:01,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:02:01,870 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:02:01,870 INFO L418 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:02:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:02:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash -451153027, now seen corresponding path program 1 times [2019-09-07 21:02:01,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:02:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:02:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14427 backedges. 3442 proven. 3922 refuted. 0 times theorem prover too weak. 7063 trivial. 0 not checked. [2019-09-07 21:02:11,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:02:11,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:02:11,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:11,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 3465 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:02:11,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:02:11,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:11,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:11,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:11,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:11,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:12,830 WARN L188 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-09-07 21:02:12,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:02:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14427 backedges. 7825 proven. 2 refuted. 0 times theorem prover too weak. 6600 trivial. 0 not checked. [2019-09-07 21:02:15,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:02:15,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 21:02:15,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:02:15,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:02:15,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:02:15,234 INFO L87 Difference]: Start difference. First operand 25653 states and 26066 transitions. Second operand 21 states. [2019-09-07 21:02:22,990 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 21:02:23,653 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2019-09-07 21:02:26,456 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 21:02:27,636 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 21:02:29,810 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2019-09-07 21:02:30,357 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-07 21:02:38,062 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-09-07 21:02:39,411 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-09-07 21:02:41,396 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-07 21:02:42,912 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-07 21:02:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:02:43,803 INFO L93 Difference]: Finished difference Result 52022 states and 52932 transitions. [2019-09-07 21:02:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 21:02:43,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2757 [2019-09-07 21:02:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:02:43,840 INFO L225 Difference]: With dead ends: 52022 [2019-09-07 21:02:43,840 INFO L226 Difference]: Without dead ends: 28409 [2019-09-07 21:02:43,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2928 GetRequests, 2819 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1534, Invalid=10676, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 21:02:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28409 states. [2019-09-07 21:02:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28409 to 27356. [2019-09-07 21:02:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27356 states. [2019-09-07 21:02:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27356 states to 27356 states and 27800 transitions. [2019-09-07 21:02:44,227 INFO L78 Accepts]: Start accepts. Automaton has 27356 states and 27800 transitions. Word has length 2757 [2019-09-07 21:02:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:02:44,232 INFO L475 AbstractCegarLoop]: Abstraction has 27356 states and 27800 transitions. [2019-09-07 21:02:44,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:02:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 27356 states and 27800 transitions. [2019-09-07 21:02:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2869 [2019-09-07 21:02:44,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:02:44,323 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:02:44,323 INFO L418 AbstractCegarLoop]: === Iteration 26 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:02:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:02:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 65951516, now seen corresponding path program 1 times [2019-09-07 21:02:44,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:02:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:02:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15547 backedges. 491 proven. 2043 refuted. 0 times theorem prover too weak. 13013 trivial. 0 not checked. [2019-09-07 21:02:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:02:49,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:02:49,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:49,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 21:02:49,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:02:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:50,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15547 backedges. 5420 proven. 320 refuted. 0 times theorem prover too weak. 9807 trivial. 0 not checked. [2019-09-07 21:02:53,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:02:53,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2019-09-07 21:02:53,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:02:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:02:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=102, Unknown=1, NotChecked=0, Total=132 [2019-09-07 21:02:53,575 INFO L87 Difference]: Start difference. First operand 27356 states and 27800 transitions. Second operand 12 states. [2019-09-07 21:04:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:04:08,913 INFO L93 Difference]: Finished difference Result 62391 states and 64020 transitions. [2019-09-07 21:04:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 21:04:08,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2868 [2019-09-07 21:04:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:04:08,979 INFO L225 Difference]: With dead ends: 62391 [2019-09-07 21:04:08,979 INFO L226 Difference]: Without dead ends: 37080 [2019-09-07 21:04:09,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2909 GetRequests, 2878 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=178, Invalid=748, Unknown=4, NotChecked=0, Total=930 [2019-09-07 21:04:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37080 states. [2019-09-07 21:04:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37080 to 33210. [2019-09-07 21:04:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33210 states. [2019-09-07 21:04:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33210 states to 33210 states and 33747 transitions. [2019-09-07 21:04:09,423 INFO L78 Accepts]: Start accepts. Automaton has 33210 states and 33747 transitions. Word has length 2868 [2019-09-07 21:04:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:04:09,425 INFO L475 AbstractCegarLoop]: Abstraction has 33210 states and 33747 transitions. [2019-09-07 21:04:09,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:04:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33210 states and 33747 transitions. [2019-09-07 21:04:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2887 [2019-09-07 21:04:09,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:04:09,577 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:04:09,577 INFO L418 AbstractCegarLoop]: === Iteration 27 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:04:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:04:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash 550497716, now seen corresponding path program 1 times [2019-09-07 21:04:09,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:04:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:04:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15465 backedges. 1973 proven. 5746 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2019-09-07 21:04:18,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:04:18,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:04:18,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:18,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 3594 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:04:18,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:04:18,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:18,949 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 15 [2019-09-07 21:04:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:04:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15465 backedges. 8222 proven. 2 refuted. 0 times theorem prover too weak. 7241 trivial. 0 not checked. [2019-09-07 21:04:21,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:04:21,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 21:04:21,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 21:04:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 21:04:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-07 21:04:21,624 INFO L87 Difference]: Start difference. First operand 33210 states and 33747 transitions. Second operand 24 states. [2019-09-07 21:04:23,745 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-09-07 21:04:33,301 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-09-07 21:04:34,597 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 25 [2019-09-07 21:04:40,299 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-09-07 21:04:42,741 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 21:05:37,364 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-07 21:06:09,254 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-07 21:06:25,022 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 21:06:26,072 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-07 21:06:26,323 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-07 21:06:27,055 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2019-09-07 21:06:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:06:32,473 INFO L93 Difference]: Finished difference Result 66098 states and 67192 transitions. [2019-09-07 21:06:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 21:06:32,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2886 [2019-09-07 21:06:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:06:32,518 INFO L225 Difference]: With dead ends: 66098 [2019-09-07 21:06:32,518 INFO L226 Difference]: Without dead ends: 35273 [2019-09-07 21:06:32,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2993 GetRequests, 2924 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=822, Invalid=4148, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 21:06:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35273 states. [2019-09-07 21:06:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35273 to 32892. [2019-09-07 21:06:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32892 states. [2019-09-07 21:06:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32892 states to 32892 states and 33405 transitions. [2019-09-07 21:06:32,880 INFO L78 Accepts]: Start accepts. Automaton has 32892 states and 33405 transitions. Word has length 2886 [2019-09-07 21:06:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:06:32,881 INFO L475 AbstractCegarLoop]: Abstraction has 32892 states and 33405 transitions. [2019-09-07 21:06:32,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 21:06:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32892 states and 33405 transitions. [2019-09-07 21:06:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2926 [2019-09-07 21:06:32,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:06:32,943 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:06:32,943 INFO L418 AbstractCegarLoop]: === Iteration 28 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:06:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:06:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -364257029, now seen corresponding path program 1 times [2019-09-07 21:06:32,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:06:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:06:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:06:32,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:06:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:06:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 21:06:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 21:06:33,993 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 21:06:34,001 INFO L168 Benchmark]: Toolchain (without parser) took 670392.44 ms. Allocated memory was 135.8 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 86.8 MB in the beginning and 503.1 MB in the end (delta: -416.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,002 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1377.14 ms. Allocated memory was 135.8 MB in the beginning and 228.1 MB in the end (delta: 92.3 MB). Free memory was 86.6 MB in the beginning and 172.4 MB in the end (delta: -85.7 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,007 INFO L168 Benchmark]: Boogie Preprocessor took 165.61 ms. Allocated memory is still 228.1 MB. Free memory was 172.4 MB in the beginning and 161.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,008 INFO L168 Benchmark]: RCFGBuilder took 2845.61 ms. Allocated memory was 228.1 MB in the beginning and 263.7 MB in the end (delta: 35.7 MB). Free memory was 161.7 MB in the beginning and 214.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 113.2 MB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,009 INFO L168 Benchmark]: TraceAbstraction took 666000.29 ms. Allocated memory was 263.7 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 212.1 MB in the beginning and 503.1 MB in the end (delta: -290.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-09-07 21:06:34,019 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1377.14 ms. Allocated memory was 135.8 MB in the beginning and 228.1 MB in the end (delta: 92.3 MB). Free memory was 86.6 MB in the beginning and 172.4 MB in the end (delta: -85.7 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.61 ms. Allocated memory is still 228.1 MB. Free memory was 172.4 MB in the beginning and 161.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2845.61 ms. Allocated memory was 228.1 MB in the beginning and 263.7 MB in the end (delta: 35.7 MB). Free memory was 161.7 MB in the beginning and 214.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 113.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 666000.29 ms. Allocated memory was 263.7 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 212.1 MB in the beginning and 503.1 MB in the end (delta: -290.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...