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/Problem14_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:03:16,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:03:16,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:03:16,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:03:16,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:03:16,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:03:16,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:03:16,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:03:16,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:03:16,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:03:16,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:03:16,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:03:16,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:03:16,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:03:16,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:03:16,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:03:16,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:03:16,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:03:16,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:03:16,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:03:16,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:03:16,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:03:16,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:03:16,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:03:16,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:03:16,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:03:16,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:03:16,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:03:16,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:03:16,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:03:16,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:03:16,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:03:16,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:03:16,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:03:16,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:03:16,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:03:16,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:03:16,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:03:16,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:03:16,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:03:16,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:03:16,604 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:03:16,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:03:16,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:03:16,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:03:16,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:03:16,620 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:03:16,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:03:16,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:03:16,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:03:16,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:03:16,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:03:16,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:03:16,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:03:16,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:03:16,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:03:16,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:03:16,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:03:16,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:03:16,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:03:16,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:03:16,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:03:16,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:03:16,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:03:16,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:03:16,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:03:16,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:03:16,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:03:16,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:03:16,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:03:16,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:03:16,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:03:16,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:03:16,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:03:16,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:03:16,670 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:03:16,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label04.c [2019-09-07 20:03:16,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09215d456/28f577293e4648c3997d97d482af7a9c/FLAG16b2766f3 [2019-09-07 20:03:17,275 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:03:17,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label04.c [2019-09-07 20:03:17,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09215d456/28f577293e4648c3997d97d482af7a9c/FLAG16b2766f3 [2019-09-07 20:03:17,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09215d456/28f577293e4648c3997d97d482af7a9c [2019-09-07 20:03:17,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:03:17,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:03:17,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:03:17,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:03:17,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:03:17,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:03:17" (1/1) ... [2019-09-07 20:03:17,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6e9d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:17, skipping insertion in model container [2019-09-07 20:03:17,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:03:17" (1/1) ... [2019-09-07 20:03:17,588 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:03:17,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:03:18,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:03:18,200 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:03:18,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:03:18,399 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:03:18,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18 WrapperNode [2019-09-07 20:03:18,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:03:18,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:03:18,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:03:18,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:03:18,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... [2019-09-07 20:03:18,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:03:18,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:03:18,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:03:18,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:03:18,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:03:18,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:03:18,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:03:18,642 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:03:18,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:03:18,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:03:18,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:03:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:03:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:03:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:03:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:03:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:03:20,174 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:03:20,174 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:03:20,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:03:20 BoogieIcfgContainer [2019-09-07 20:03:20,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:03:20,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:03:20,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:03:20,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:03:20,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:03:17" (1/3) ... [2019-09-07 20:03:20,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf04dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:03:20, skipping insertion in model container [2019-09-07 20:03:20,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:03:18" (2/3) ... [2019-09-07 20:03:20,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf04dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:03:20, skipping insertion in model container [2019-09-07 20:03:20,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:03:20" (3/3) ... [2019-09-07 20:03:20,192 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label04.c [2019-09-07 20:03:20,205 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:03:20,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:03:20,230 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:03:20,271 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:03:20,272 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:03:20,273 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:03:20,273 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:03:20,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:03:20,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:03:20,274 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:03:20,274 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:03:20,274 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:03:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:03:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 20:03:20,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:20,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:20,322 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash 111539867, now seen corresponding path program 1 times [2019-09-07 20:03:20,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:20,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:20,674 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:03:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:03:20,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:03:20,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:03:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:03:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:03:20,699 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-07 20:03:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:21,783 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-09-07 20:03:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:03:21,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-07 20:03:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:21,818 INFO L225 Difference]: With dead ends: 688 [2019-09-07 20:03:21,818 INFO L226 Difference]: Without dead ends: 372 [2019-09-07 20:03:21,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:03:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-07 20:03:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-09-07 20:03:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 20:03:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-09-07 20:03:21,916 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 58 [2019-09-07 20:03:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:21,918 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-09-07 20:03:21,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:03:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-09-07 20:03:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 20:03:21,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:21,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:03:21,934 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1919081915, now seen corresponding path program 1 times [2019-09-07 20:03:21,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:21,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:22,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:03:22,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:03:22,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:03:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:03:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:03:22,207 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-09-07 20:03:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:23,485 INFO L93 Difference]: Finished difference Result 1122 states and 1837 transitions. [2019-09-07 20:03:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:03:23,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-07 20:03:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:23,491 INFO L225 Difference]: With dead ends: 1122 [2019-09-07 20:03:23,491 INFO L226 Difference]: Without dead ends: 756 [2019-09-07 20:03:23,493 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:03:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-07 20:03:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2019-09-07 20:03:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-07 20:03:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2019-09-07 20:03:23,543 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 127 [2019-09-07 20:03:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:23,544 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2019-09-07 20:03:23,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:03:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2019-09-07 20:03:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 20:03:23,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:23,550 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:03:23,551 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash -36826466, now seen corresponding path program 1 times [2019-09-07 20:03:23,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:23,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:23,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:23,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:03:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:03:23,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:03:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:03:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:03:23,652 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2019-09-07 20:03:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:24,871 INFO L93 Difference]: Finished difference Result 1904 states and 3099 transitions. [2019-09-07 20:03:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:03:24,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-07 20:03:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:24,881 INFO L225 Difference]: With dead ends: 1904 [2019-09-07 20:03:24,882 INFO L226 Difference]: Without dead ends: 1158 [2019-09-07 20:03:24,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:03:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-07 20:03:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2019-09-07 20:03:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-07 20:03:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2019-09-07 20:03:24,938 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 128 [2019-09-07 20:03:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:24,939 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2019-09-07 20:03:24,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:03:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2019-09-07 20:03:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 20:03:24,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:24,942 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:03:24,943 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1534338682, now seen corresponding path program 1 times [2019-09-07 20:03:24,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:24,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:25,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:03:25,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:03:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:03:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:03:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:03:25,065 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2019-09-07 20:03:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:26,211 INFO L93 Difference]: Finished difference Result 2880 states and 4162 transitions. [2019-09-07 20:03:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:03:26,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-07 20:03:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:26,222 INFO L225 Difference]: With dead ends: 2880 [2019-09-07 20:03:26,222 INFO L226 Difference]: Without dead ends: 1748 [2019-09-07 20:03:26,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:03:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-09-07 20:03:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2019-09-07 20:03:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-09-07 20:03:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2019-09-07 20:03:26,277 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 130 [2019-09-07 20:03:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:26,278 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2019-09-07 20:03:26,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:03:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2019-09-07 20:03:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-07 20:03:26,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:26,282 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:26,283 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1391402673, now seen corresponding path program 1 times [2019-09-07 20:03:26,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 173 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:26,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:26,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:03:26,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:27,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:03:27,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:03:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 20:03:27,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:03:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-07 20:03:27,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:03:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:03:27,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:03:27,214 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 14 states. [2019-09-07 20:03:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:31,438 INFO L93 Difference]: Finished difference Result 2981 states and 4194 transitions. [2019-09-07 20:03:31,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 20:03:31,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 214 [2019-09-07 20:03:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:31,449 INFO L225 Difference]: With dead ends: 2981 [2019-09-07 20:03:31,449 INFO L226 Difference]: Without dead ends: 1601 [2019-09-07 20:03:31,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 20:03:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-09-07 20:03:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1516. [2019-09-07 20:03:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-09-07 20:03:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2067 transitions. [2019-09-07 20:03:31,513 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2067 transitions. Word has length 214 [2019-09-07 20:03:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:31,514 INFO L475 AbstractCegarLoop]: Abstraction has 1516 states and 2067 transitions. [2019-09-07 20:03:31,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:03:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2067 transitions. [2019-09-07 20:03:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 20:03:31,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:31,518 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:31,518 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1493050141, now seen corresponding path program 1 times [2019-09-07 20:03:31,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:31,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 125 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:31,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:31,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:03:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:31,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:03:31,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:31,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:03:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 20:03:32,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:03:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 20:03:32,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:03:32,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:03:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:03:32,067 INFO L87 Difference]: Start difference. First operand 1516 states and 2067 transitions. Second operand 10 states. [2019-09-07 20:03:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:37,218 INFO L93 Difference]: Finished difference Result 6466 states and 9145 transitions. [2019-09-07 20:03:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 20:03:37,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 240 [2019-09-07 20:03:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:37,246 INFO L225 Difference]: With dead ends: 6466 [2019-09-07 20:03:37,247 INFO L226 Difference]: Without dead ends: 4956 [2019-09-07 20:03:37,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=461, Invalid=1795, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 20:03:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-07 20:03:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4700. [2019-09-07 20:03:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4700 states. [2019-09-07 20:03:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4700 states and 6065 transitions. [2019-09-07 20:03:37,392 INFO L78 Accepts]: Start accepts. Automaton has 4700 states and 6065 transitions. Word has length 240 [2019-09-07 20:03:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:37,393 INFO L475 AbstractCegarLoop]: Abstraction has 4700 states and 6065 transitions. [2019-09-07 20:03:37,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:03:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4700 states and 6065 transitions. [2019-09-07 20:03:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 20:03:37,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:37,402 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:03:37,410 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1990732249, now seen corresponding path program 1 times [2019-09-07 20:03:37,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:37,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:37,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 239 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:03:38,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:38,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:38,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 20:03:38,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:38,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:03:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 278 proven. 53 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 20:03:38,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-09-07 20:03:38,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:03:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:03:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:03:38,777 INFO L87 Difference]: Start difference. First operand 4700 states and 6065 transitions. Second operand 15 states. [2019-09-07 20:03:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:41,238 INFO L93 Difference]: Finished difference Result 9334 states and 12123 transitions. [2019-09-07 20:03:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:03:41,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2019-09-07 20:03:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:41,260 INFO L225 Difference]: With dead ends: 9334 [2019-09-07 20:03:41,260 INFO L226 Difference]: Without dead ends: 4724 [2019-09-07 20:03:41,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-09-07 20:03:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2019-09-07 20:03:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4308. [2019-09-07 20:03:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4308 states. [2019-09-07 20:03:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 5230 transitions. [2019-09-07 20:03:41,380 INFO L78 Accepts]: Start accepts. Automaton has 4308 states and 5230 transitions. Word has length 327 [2019-09-07 20:03:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:41,380 INFO L475 AbstractCegarLoop]: Abstraction has 4308 states and 5230 transitions. [2019-09-07 20:03:41,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:03:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4308 states and 5230 transitions. [2019-09-07 20:03:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-09-07 20:03:41,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:41,396 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:41,397 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2117636185, now seen corresponding path program 1 times [2019-09-07 20:03:41,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:41,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 432 proven. 73 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-09-07 20:03:42,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:42,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:42,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:42,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:03:42,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 591 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-07 20:03:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-09-07 20:03:42,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:03:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:03:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:03:42,318 INFO L87 Difference]: Start difference. First operand 4308 states and 5230 transitions. Second operand 7 states. [2019-09-07 20:03:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:43,939 INFO L93 Difference]: Finished difference Result 10272 states and 12629 transitions. [2019-09-07 20:03:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:03:43,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 462 [2019-09-07 20:03:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:43,966 INFO L225 Difference]: With dead ends: 10272 [2019-09-07 20:03:43,966 INFO L226 Difference]: Without dead ends: 6152 [2019-09-07 20:03:43,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 468 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:03:43,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2019-09-07 20:03:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 5420. [2019-09-07 20:03:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5420 states. [2019-09-07 20:03:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 6489 transitions. [2019-09-07 20:03:44,097 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 6489 transitions. Word has length 462 [2019-09-07 20:03:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:44,098 INFO L475 AbstractCegarLoop]: Abstraction has 5420 states and 6489 transitions. [2019-09-07 20:03:44,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:03:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 6489 transitions. [2019-09-07 20:03:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-09-07 20:03:44,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:44,118 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:44,118 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash 691251745, now seen corresponding path program 1 times [2019-09-07 20:03:44,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:44,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 578 proven. 396 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 20:03:45,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:45,375 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:03:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:45,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 20:03:45,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:45,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:03:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 802 proven. 2 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-09-07 20:03:46,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-07 20:03:46,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:03:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:03:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:03:46,416 INFO L87 Difference]: Start difference. First operand 5420 states and 6489 transitions. Second operand 17 states. [2019-09-07 20:03:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:48,822 INFO L93 Difference]: Finished difference Result 10882 states and 13527 transitions. [2019-09-07 20:03:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:03:48,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 567 [2019-09-07 20:03:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:48,860 INFO L225 Difference]: With dead ends: 10882 [2019-09-07 20:03:48,861 INFO L226 Difference]: Without dead ends: 5564 [2019-09-07 20:03:48,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-07 20:03:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5564 states. [2019-09-07 20:03:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5564 to 5420. [2019-09-07 20:03:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5420 states. [2019-09-07 20:03:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 6139 transitions. [2019-09-07 20:03:49,037 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 6139 transitions. Word has length 567 [2019-09-07 20:03:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:49,039 INFO L475 AbstractCegarLoop]: Abstraction has 5420 states and 6139 transitions. [2019-09-07 20:03:49,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:03:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 6139 transitions. [2019-09-07 20:03:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-07 20:03:49,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:49,061 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:49,061 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2142196595, now seen corresponding path program 1 times [2019-09-07 20:03:49,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:49,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 604 proven. 422 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 20:03:50,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:50,418 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:03:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:50,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:03:50,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:50,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:03:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 828 proven. 2 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2019-09-07 20:03:50,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:50,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:03:50,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:03:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:03:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:03:50,882 INFO L87 Difference]: Start difference. First operand 5420 states and 6139 transitions. Second operand 17 states. [2019-09-07 20:03:55,728 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 20:03:55,934 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-07 20:03:56,973 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 20:03:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:57,502 INFO L93 Difference]: Finished difference Result 11790 states and 13425 transitions. [2019-09-07 20:03:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 20:03:57,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 593 [2019-09-07 20:03:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:57,528 INFO L225 Difference]: With dead ends: 11790 [2019-09-07 20:03:57,528 INFO L226 Difference]: Without dead ends: 6558 [2019-09-07 20:03:57,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=434, Invalid=1822, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 20:03:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2019-09-07 20:03:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 5422. [2019-09-07 20:03:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-07 20:03:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 6097 transitions. [2019-09-07 20:03:57,686 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 6097 transitions. Word has length 593 [2019-09-07 20:03:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:57,687 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 6097 transitions. [2019-09-07 20:03:57,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:03:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 6097 transitions. [2019-09-07 20:03:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-09-07 20:03:57,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:57,698 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:57,698 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1362041433, now seen corresponding path program 1 times [2019-09-07 20:03:57,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 709 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 20:03:58,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:58,245 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:03:58,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:58,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:03:58,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 709 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 20:03:58,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:58,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:03:58,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:03:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:03:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:03:58,737 INFO L87 Difference]: Start difference. First operand 5422 states and 6097 transitions. Second operand 7 states. [2019-09-07 20:03:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:59,873 INFO L93 Difference]: Finished difference Result 12502 states and 14188 transitions. [2019-09-07 20:03:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:03:59,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 667 [2019-09-07 20:03:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:59,896 INFO L225 Difference]: With dead ends: 12502 [2019-09-07 20:03:59,896 INFO L226 Difference]: Without dead ends: 7268 [2019-09-07 20:03:59,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:03:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2019-09-07 20:04:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7076. [2019-09-07 20:04:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7076 states. [2019-09-07 20:04:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7076 states to 7076 states and 8011 transitions. [2019-09-07 20:04:00,042 INFO L78 Accepts]: Start accepts. Automaton has 7076 states and 8011 transitions. Word has length 667 [2019-09-07 20:04:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:00,043 INFO L475 AbstractCegarLoop]: Abstraction has 7076 states and 8011 transitions. [2019-09-07 20:04:00,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:04:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7076 states and 8011 transitions. [2019-09-07 20:04:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-09-07 20:04:00,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:00,057 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-09-07 20:04:00,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 553788386, now seen corresponding path program 1 times [2019-09-07 20:04:00,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:00,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:00,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1659 backedges. 768 proven. 710 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 20:04:01,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:01,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:04:01,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:01,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:04:01,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1659 backedges. 1043 proven. 2 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-09-07 20:04:01,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:01,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:04:01,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:04:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:04:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:04:01,676 INFO L87 Difference]: Start difference. First operand 7076 states and 8011 transitions. Second operand 14 states. [2019-09-07 20:04:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:05,813 INFO L93 Difference]: Finished difference Result 14404 states and 16432 transitions. [2019-09-07 20:04:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 20:04:05,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 681 [2019-09-07 20:04:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:05,834 INFO L225 Difference]: With dead ends: 14404 [2019-09-07 20:04:05,834 INFO L226 Difference]: Without dead ends: 7516 [2019-09-07 20:04:05,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 20:04:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2019-09-07 20:04:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7260. [2019-09-07 20:04:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-09-07 20:04:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 8088 transitions. [2019-09-07 20:04:06,002 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 8088 transitions. Word has length 681 [2019-09-07 20:04:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:06,004 INFO L475 AbstractCegarLoop]: Abstraction has 7260 states and 8088 transitions. [2019-09-07 20:04:06,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:04:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 8088 transitions. [2019-09-07 20:04:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2019-09-07 20:04:06,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:06,022 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:04:06,022 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 983917279, now seen corresponding path program 1 times [2019-09-07 20:04:06,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:06,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:06,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 713 proven. 577 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-09-07 20:04:07,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:07,616 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:04:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:07,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:04:07,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:07,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 1121 proven. 2 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2019-09-07 20:04:08,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:08,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:04:08,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:04:08,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:04:08,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:04:08,210 INFO L87 Difference]: Start difference. First operand 7260 states and 8088 transitions. Second operand 17 states. [2019-09-07 20:04:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:17,005 INFO L93 Difference]: Finished difference Result 16048 states and 17840 transitions. [2019-09-07 20:04:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 20:04:17,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 788 [2019-09-07 20:04:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:17,048 INFO L225 Difference]: With dead ends: 16048 [2019-09-07 20:04:17,048 INFO L226 Difference]: Without dead ends: 8976 [2019-09-07 20:04:17,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 842 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1324, Invalid=6508, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 20:04:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8976 states. [2019-09-07 20:04:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8976 to 7452. [2019-09-07 20:04:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7452 states. [2019-09-07 20:04:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 8209 transitions. [2019-09-07 20:04:17,206 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 8209 transitions. Word has length 788 [2019-09-07 20:04:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:17,208 INFO L475 AbstractCegarLoop]: Abstraction has 7452 states and 8209 transitions. [2019-09-07 20:04:17,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:04:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 8209 transitions. [2019-09-07 20:04:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-09-07 20:04:17,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:17,223 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:04:17,224 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1413186048, now seen corresponding path program 1 times [2019-09-07 20:04:17,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 926 proven. 50 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2019-09-07 20:04:18,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:18,071 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:04:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:18,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 20:04:18,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 926 proven. 50 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2019-09-07 20:04:18,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:19,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 20:04:19,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:04:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:04:19,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:04:19,002 INFO L87 Difference]: Start difference. First operand 7452 states and 8209 transitions. Second operand 10 states. [2019-09-07 20:04:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:36,985 INFO L93 Difference]: Finished difference Result 16570 states and 18280 transitions. [2019-09-07 20:04:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:04:36,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 842 [2019-09-07 20:04:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:37,012 INFO L225 Difference]: With dead ends: 16570 [2019-09-07 20:04:37,012 INFO L226 Difference]: Without dead ends: 9308 [2019-09-07 20:04:37,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 846 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:04:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9308 states. [2019-09-07 20:04:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9308 to 8746. [2019-09-07 20:04:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8746 states. [2019-09-07 20:04:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8746 states to 8746 states and 9604 transitions. [2019-09-07 20:04:37,179 INFO L78 Accepts]: Start accepts. Automaton has 8746 states and 9604 transitions. Word has length 842 [2019-09-07 20:04:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:37,180 INFO L475 AbstractCegarLoop]: Abstraction has 8746 states and 9604 transitions. [2019-09-07 20:04:37,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:04:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8746 states and 9604 transitions. [2019-09-07 20:04:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2019-09-07 20:04:37,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:37,196 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:04:37,197 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:37,198 INFO L82 PathProgramCache]: Analyzing trace with hash 450250746, now seen corresponding path program 1 times [2019-09-07 20:04:37,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:37,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 925 proven. 1174 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2019-09-07 20:04:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:39,466 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:04:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:39,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:04:39,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:39,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 1355 proven. 2 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-09-07 20:04:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 20:04:40,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 20:04:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 20:04:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:04:40,380 INFO L87 Difference]: Start difference. First operand 8746 states and 9604 transitions. Second operand 21 states. [2019-09-07 20:04:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:46,213 INFO L93 Difference]: Finished difference Result 17393 states and 19175 transitions. [2019-09-07 20:04:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 20:04:46,214 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 932 [2019-09-07 20:04:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:46,236 INFO L225 Difference]: With dead ends: 17393 [2019-09-07 20:04:46,236 INFO L226 Difference]: Without dead ends: 8837 [2019-09-07 20:04:46,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 959 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=577, Invalid=2285, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 20:04:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8837 states. [2019-09-07 20:04:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8837 to 7644. [2019-09-07 20:04:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-09-07 20:04:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 8281 transitions. [2019-09-07 20:04:46,402 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 8281 transitions. Word has length 932 [2019-09-07 20:04:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:46,403 INFO L475 AbstractCegarLoop]: Abstraction has 7644 states and 8281 transitions. [2019-09-07 20:04:46,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 20:04:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 8281 transitions. [2019-09-07 20:04:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-09-07 20:04:46,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:46,422 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:04:46,422 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -275487925, now seen corresponding path program 1 times [2019-09-07 20:04:46,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 491 proven. 861 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2019-09-07 20:04:47,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:47,685 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:04:47,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 20:04:47,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:48,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:48,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:48,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,540 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 547 DAG size of output: 27 [2019-09-07 20:04:50,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:50,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:53,017 WARN L188 SmtUtils]: Spent 2.03 m on a formula simplification. DAG size of input: 241 DAG size of output: 97 [2019-09-07 20:06:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-07 20:06:53,558 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-09-07 20:06:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 1283 proven. 181 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-07 20:06:54,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:54,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-09-07 20:06:54,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:06:54,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:06:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:06:54,769 INFO L87 Difference]: Start difference. First operand 7644 states and 8281 transitions. Second operand 20 states. [2019-09-07 20:06:57,532 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 20:08:59,590 WARN L188 SmtUtils]: Spent 2.01 m on a formula simplification. DAG size of input: 133 DAG size of output: 116 [2019-09-07 20:11:02,863 WARN L188 SmtUtils]: Spent 2.03 m on a formula simplification. DAG size of input: 135 DAG size of output: 122 [2019-09-07 20:11:14,525 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-07 20:11:24,338 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-07 20:12:27,864 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification that was a NOOP. DAG size: 128 [2019-09-07 20:12:37,048 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-07 20:13:42,541 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 136 DAG size of output: 102 [2019-09-07 20:14:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:31,753 INFO L93 Difference]: Finished difference Result 16159 states and 17577 transitions. [2019-09-07 20:14:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-07 20:14:31,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 961 [2019-09-07 20:14:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:31,771 INFO L225 Difference]: With dead ends: 16159 [2019-09-07 20:14:31,772 INFO L226 Difference]: Without dead ends: 8705 [2019-09-07 20:14:31,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1016 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5355 ImplicationChecksByTransitivity, 504.3s TimeCoverageRelationStatistics Valid=1797, Invalid=11771, Unknown=4, NotChecked=0, Total=13572 [2019-09-07 20:14:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2019-09-07 20:14:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 7660. [2019-09-07 20:14:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7660 states. [2019-09-07 20:14:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7660 states to 7660 states and 8230 transitions. [2019-09-07 20:14:31,911 INFO L78 Accepts]: Start accepts. Automaton has 7660 states and 8230 transitions. Word has length 961 [2019-09-07 20:14:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:31,913 INFO L475 AbstractCegarLoop]: Abstraction has 7660 states and 8230 transitions. [2019-09-07 20:14:31,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:14:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 7660 states and 8230 transitions. [2019-09-07 20:14:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2019-09-07 20:14:31,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:31,933 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:31,933 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1892685229, now seen corresponding path program 1 times [2019-09-07 20:14:31,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:31,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:31,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1225 proven. 1226 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-07 20:14:34,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:34,396 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:14:34,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:34,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:14:34,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2019-09-07 20:14:35,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:14:35,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-09-07 20:14:35,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:14:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:14:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:14:35,118 INFO L87 Difference]: Start difference. First operand 7660 states and 8230 transitions. Second operand 15 states. [2019-09-07 20:14:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:38,867 INFO L93 Difference]: Finished difference Result 15355 states and 16876 transitions. [2019-09-07 20:14:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 20:14:38,872 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1057 [2019-09-07 20:14:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:38,889 INFO L225 Difference]: With dead ends: 15355 [2019-09-07 20:14:38,890 INFO L226 Difference]: Without dead ends: 7789 [2019-09-07 20:14:38,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1077 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 20:14:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2019-09-07 20:14:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 7522. [2019-09-07 20:14:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-09-07 20:14:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 8047 transitions. [2019-09-07 20:14:39,032 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 8047 transitions. Word has length 1057 [2019-09-07 20:14:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:39,033 INFO L475 AbstractCegarLoop]: Abstraction has 7522 states and 8047 transitions. [2019-09-07 20:14:39,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:14:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 8047 transitions. [2019-09-07 20:14:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2019-09-07 20:14:39,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:39,050 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 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:14:39,051 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:39,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1143284603, now seen corresponding path program 1 times [2019-09-07 20:14:39,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:39,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:39,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3470 backedges. 883 proven. 54 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2019-09-07 20:14:40,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:40,629 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:14:40,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:40,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:14:40,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:40,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:40,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:58,240 WARN L188 SmtUtils]: Spent 1.25 m on a formula simplification. DAG size of input: 305 DAG size of output: 133 [2019-09-07 20:15:58,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 20:15:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3470 backedges. 1561 proven. 108 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-09-07 20:15:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:59,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-07 20:15:59,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:15:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:15:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2019-09-07 20:15:59,539 INFO L87 Difference]: Start difference. First operand 7522 states and 8047 transitions. Second operand 16 states. [2019-09-07 20:17:11,589 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 143 DAG size of output: 129