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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:55:50,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:55:50,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:55:50,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:55:50,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:55:50,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:55:50,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:55:50,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:55:50,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:55:50,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:55:50,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:55:50,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:55:50,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:55:50,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:55:50,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:55:50,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:55:50,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:55:50,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:55:50,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:55:50,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:55:50,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:55:50,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:55:50,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:55:50,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:55:50,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:55:50,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:55:50,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:55:50,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:55:50,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:55:50,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:55:50,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:55:50,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:55:50,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:55:50,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:55:50,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:55:50,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:55:50,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:55:50,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:55:50,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:55:50,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:55:50,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:55:50,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:55:50,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:55:50,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:55:50,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:55:50,801 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:55:50,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:55:50,802 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:55:50,802 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:55:50,802 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:55:50,802 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:55:50,803 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:55:50,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:55:50,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:55:50,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:55:50,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:55:50,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:55:50,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:55:50,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:55:50,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:55:50,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:55:50,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:55:50,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:55:50,806 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:55:50,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:55:50,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:55:50,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:55:50,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:55:50,807 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:55:50,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:55:50,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:55:50,808 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:55:50,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:55:50,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:55:50,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:55:50,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:55:50,856 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:55:50,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59.c [2019-10-02 20:55:50,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0b7d363/588b6281a26c402ca0ff1b5dc50413ac/FLAG451da9121 [2019-10-02 20:55:51,444 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:55:51,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label59.c [2019-10-02 20:55:51,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0b7d363/588b6281a26c402ca0ff1b5dc50413ac/FLAG451da9121 [2019-10-02 20:55:51,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0b7d363/588b6281a26c402ca0ff1b5dc50413ac [2019-10-02 20:55:51,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:55:51,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:55:51,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:55:51,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:55:51,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:55:51,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:55:51" (1/1) ... [2019-10-02 20:55:51,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22902a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:51, skipping insertion in model container [2019-10-02 20:55:51,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:55:51" (1/1) ... [2019-10-02 20:55:51,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:55:51,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:55:52,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:55:52,382 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:55:52,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:55:52,619 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:55:52,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52 WrapperNode [2019-10-02 20:55:52,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:55:52,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:55:52,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:55:52,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:55:52,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... [2019-10-02 20:55:52,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:55:52,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:55:52,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:55:52,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:55:52,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:55:52,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:55:52,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:55:52,937 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:55:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:55:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:55:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:55:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:55:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:55:54,594 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:55:54,595 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:55:54,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:55:54 BoogieIcfgContainer [2019-10-02 20:55:54,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:55:54,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:55:54,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:55:54,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:55:54,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:55:51" (1/3) ... [2019-10-02 20:55:54,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2abf1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:55:54, skipping insertion in model container [2019-10-02 20:55:54,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:55:52" (2/3) ... [2019-10-02 20:55:54,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2abf1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:55:54, skipping insertion in model container [2019-10-02 20:55:54,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:55:54" (3/3) ... [2019-10-02 20:55:54,607 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label59.c [2019-10-02 20:55:54,618 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:55:54,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:55:54,645 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:55:54,677 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:55:54,678 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:55:54,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:55:54,679 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:55:54,679 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:55:54,679 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:55:54,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:55:54,680 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:55:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:55:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 20:55:54,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:55:54,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:55:54,727 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:55:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:55:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1317211861, now seen corresponding path program 1 times [2019-10-02 20:55:54,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:55:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:54,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:55:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:54,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:55:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:55:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:55:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:55:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:55:55,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:55:55,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:55:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:55:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:55:55,058 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:55:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:55:56,412 INFO L93 Difference]: Finished difference Result 440 states and 718 transitions. [2019-10-02 20:55:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:55:56,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 20:55:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:55:56,448 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:55:56,449 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:55:56,452 INFO L640 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-10-02 20:55:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:55:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:55:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:55:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-02 20:55:56,543 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 46 [2019-10-02 20:55:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:55:56,543 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-02 20:55:56,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:55:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-02 20:55:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 20:55:56,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:55:56,549 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:55:56,550 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:55:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:55:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1317882645, now seen corresponding path program 1 times [2019-10-02 20:55:56,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:55:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:56,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:55:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:56,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:55:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:55:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:55:56,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:55:56,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:55:56,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:55:56,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:55:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:55:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:55:56,848 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-02 20:55:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:55:58,260 INFO L93 Difference]: Finished difference Result 570 states and 887 transitions. [2019-10-02 20:55:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:55:58,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-02 20:55:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:55:58,265 INFO L225 Difference]: With dead ends: 570 [2019-10-02 20:55:58,266 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 20:55:58,267 INFO L640 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-10-02 20:55:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 20:55:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2019-10-02 20:55:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 20:55:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 877 transitions. [2019-10-02 20:55:58,302 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 877 transitions. Word has length 115 [2019-10-02 20:55:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:55:58,302 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 877 transitions. [2019-10-02 20:55:58,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:55:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 877 transitions. [2019-10-02 20:55:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 20:55:58,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:55:58,306 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:55:58,306 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:55:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:55:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -781180306, now seen corresponding path program 1 times [2019-10-02 20:55:58,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:55:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:55:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:58,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:55:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:55:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:55:58,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:55:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 20:55:58,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:55:58,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 20:55:58,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 20:55:58,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 20:55:58,483 INFO L87 Difference]: Start difference. First operand 564 states and 877 transitions. Second operand 5 states. [2019-10-02 20:55:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:55:59,820 INFO L93 Difference]: Finished difference Result 1156 states and 1719 transitions. [2019-10-02 20:55:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:55:59,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-02 20:55:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:55:59,833 INFO L225 Difference]: With dead ends: 1156 [2019-10-02 20:55:59,833 INFO L226 Difference]: Without dead ends: 1156 [2019-10-02 20:55:59,834 INFO L640 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-10-02 20:55:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-02 20:55:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1136. [2019-10-02 20:55:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-10-02 20:55:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1659 transitions. [2019-10-02 20:55:59,889 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1659 transitions. Word has length 116 [2019-10-02 20:55:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:55:59,890 INFO L475 AbstractCegarLoop]: Abstraction has 1136 states and 1659 transitions. [2019-10-02 20:55:59,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 20:55:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1659 transitions. [2019-10-02 20:55:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 20:55:59,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:55:59,893 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:55:59,894 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:55:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:55:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2108100534, now seen corresponding path program 1 times [2019-10-02 20:55:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:55:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:59,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:55:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:55:59,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:55:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:56:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:56:00,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 20:56:00,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:00,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 20:56:00,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 20:56:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 20:56:00,066 INFO L87 Difference]: Start difference. First operand 1136 states and 1659 transitions. Second operand 5 states. [2019-10-02 20:56:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:56:01,341 INFO L93 Difference]: Finished difference Result 1748 states and 2450 transitions. [2019-10-02 20:56:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 20:56:01,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-02 20:56:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:56:01,352 INFO L225 Difference]: With dead ends: 1748 [2019-10-02 20:56:01,352 INFO L226 Difference]: Without dead ends: 1748 [2019-10-02 20:56:01,353 INFO L640 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-10-02 20:56:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-10-02 20:56:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1520. [2019-10-02 20:56:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2019-10-02 20:56:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2133 transitions. [2019-10-02 20:56:01,408 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2133 transitions. Word has length 118 [2019-10-02 20:56:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:56:01,409 INFO L475 AbstractCegarLoop]: Abstraction has 1520 states and 2133 transitions. [2019-10-02 20:56:01,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 20:56:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2133 transitions. [2019-10-02 20:56:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 20:56:01,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:56:01,412 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:56:01,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:56:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 976098381, now seen corresponding path program 1 times [2019-10-02 20:56:01,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:56:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:56:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:01,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:56:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:56:01,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:56:01,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:56:01,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:01,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:56:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:56:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:01,499 INFO L87 Difference]: Start difference. First operand 1520 states and 2133 transitions. Second operand 3 states. [2019-10-02 20:56:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:56:02,227 INFO L93 Difference]: Finished difference Result 2440 states and 3129 transitions. [2019-10-02 20:56:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:56:02,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-02 20:56:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:56:02,243 INFO L225 Difference]: With dead ends: 2440 [2019-10-02 20:56:02,244 INFO L226 Difference]: Without dead ends: 2440 [2019-10-02 20:56:02,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2019-10-02 20:56:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1702. [2019-10-02 20:56:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-10-02 20:56:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2327 transitions. [2019-10-02 20:56:02,366 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2327 transitions. Word has length 119 [2019-10-02 20:56:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:56:02,367 INFO L475 AbstractCegarLoop]: Abstraction has 1702 states and 2327 transitions. [2019-10-02 20:56:02,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:56:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2327 transitions. [2019-10-02 20:56:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 20:56:02,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:56:02,371 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:56:02,372 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:56:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1587948799, now seen corresponding path program 1 times [2019-10-02 20:56:02,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:56:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:56:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:02,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:56:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:56:02,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:56:02,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:56:02,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:02,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:56:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:56:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:02,539 INFO L87 Difference]: Start difference. First operand 1702 states and 2327 transitions. Second operand 3 states. [2019-10-02 20:56:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:56:03,343 INFO L93 Difference]: Finished difference Result 2252 states and 2848 transitions. [2019-10-02 20:56:03,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:56:03,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-02 20:56:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:56:03,354 INFO L225 Difference]: With dead ends: 2252 [2019-10-02 20:56:03,354 INFO L226 Difference]: Without dead ends: 1512 [2019-10-02 20:56:03,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-10-02 20:56:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1510. [2019-10-02 20:56:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-10-02 20:56:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2062 transitions. [2019-10-02 20:56:03,402 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2062 transitions. Word has length 141 [2019-10-02 20:56:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:56:03,404 INFO L475 AbstractCegarLoop]: Abstraction has 1510 states and 2062 transitions. [2019-10-02 20:56:03,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:56:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2062 transitions. [2019-10-02 20:56:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 20:56:03,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:56:03,410 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:56:03,411 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:56:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash -327447627, now seen corresponding path program 1 times [2019-10-02 20:56:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:56:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:03,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:56:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:03,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:56:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 20:56:03,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:56:03,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:56:03,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:03,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:56:03,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:56:03,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:03,588 INFO L87 Difference]: Start difference. First operand 1510 states and 2062 transitions. Second operand 3 states. [2019-10-02 20:56:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:56:04,451 INFO L93 Difference]: Finished difference Result 2058 states and 2616 transitions. [2019-10-02 20:56:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:56:04,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 20:56:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:56:04,459 INFO L225 Difference]: With dead ends: 2058 [2019-10-02 20:56:04,460 INFO L226 Difference]: Without dead ends: 1504 [2019-10-02 20:56:04,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:56:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-10-02 20:56:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2019-10-02 20:56:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-10-02 20:56:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2023 transitions. [2019-10-02 20:56:04,497 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2023 transitions. Word has length 232 [2019-10-02 20:56:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:56:04,498 INFO L475 AbstractCegarLoop]: Abstraction has 1504 states and 2023 transitions. [2019-10-02 20:56:04,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:56:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2023 transitions. [2019-10-02 20:56:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 20:56:04,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:56:04,504 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 20:56:04,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:56:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2108652910, now seen corresponding path program 1 times [2019-10-02 20:56:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:56:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:56:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:04,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:56:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:05,235 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-02 20:56:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:56:05,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:56:05,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:56:05,638 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2019-10-02 20:56:05,640 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [726], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:56:05,699 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:56:05,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:56:18,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:56:18,491 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Performed 303 root evaluator evaluations with a maximum evaluation depth of 13. Performed 303 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:56:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:18,495 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:56:33,315 INFO L227 lantSequenceWeakener]: Weakened 266 states. On average, predicates are now at 77.86% of their original sizes. [2019-10-02 20:56:33,315 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:56:33,419 INFO L420 sIntCurrentIteration]: We unified 284 AI predicates to 284 [2019-10-02 20:56:33,420 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:56:33,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:56:33,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2019-10-02 20:56:33,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:33,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:56:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:56:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:56:33,425 INFO L87 Difference]: Start difference. First operand 1504 states and 2023 transitions. Second operand 11 states. [2019-10-02 20:59:22,140 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 21:01:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:01:16,662 INFO L93 Difference]: Finished difference Result 1690 states and 2220 transitions. [2019-10-02 21:01:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 21:01:16,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 285 [2019-10-02 21:01:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:01:16,670 INFO L225 Difference]: With dead ends: 1690 [2019-10-02 21:01:16,670 INFO L226 Difference]: Without dead ends: 1690 [2019-10-02 21:01:16,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-02 21:01:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-10-02 21:01:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1686. [2019-10-02 21:01:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-10-02 21:01:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2213 transitions. [2019-10-02 21:01:16,709 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2213 transitions. Word has length 285 [2019-10-02 21:01:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:01:16,710 INFO L475 AbstractCegarLoop]: Abstraction has 1686 states and 2213 transitions. [2019-10-02 21:01:16,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 21:01:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2213 transitions. [2019-10-02 21:01:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-02 21:01:16,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:01:16,718 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:01:16,719 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:01:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:01:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1073396373, now seen corresponding path program 1 times [2019-10-02 21:01:16,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:01:16,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:01:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:01:16,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:01:16,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:01:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:01:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 203 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 21:01:17,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:01:17,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:01:17,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 370 with the following transitions: [2019-10-02 21:01:17,426 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [726], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 21:01:17,432 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:01:17,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:01:32,457 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:01:32,459 INFO L272 AbstractInterpreter]: Visited 136 different actions 267 times. Merged at 4 different actions 5 times. Never widened. Performed 529 root evaluator evaluations with a maximum evaluation depth of 13. Performed 529 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 21:01:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:01:32,460 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:01:38,962 INFO L227 lantSequenceWeakener]: Weakened 366 states. On average, predicates are now at 77.64% of their original sizes. [2019-10-02 21:01:38,963 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:01:39,051 INFO L420 sIntCurrentIteration]: We unified 368 AI predicates to 368 [2019-10-02 21:01:39,052 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:01:39,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:01:39,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 21:01:39,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:01:39,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 21:01:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 21:01:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 21:01:39,055 INFO L87 Difference]: Start difference. First operand 1686 states and 2213 transitions. Second operand 11 states. [2019-10-02 21:02:11,909 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 21:03:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:03:43,425 INFO L93 Difference]: Finished difference Result 1902 states and 2429 transitions. [2019-10-02 21:03:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 21:03:43,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 369 [2019-10-02 21:03:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:03:43,434 INFO L225 Difference]: With dead ends: 1902 [2019-10-02 21:03:43,434 INFO L226 Difference]: Without dead ends: 1687 [2019-10-02 21:03:43,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 21:03:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-10-02 21:03:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1686. [2019-10-02 21:03:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-10-02 21:03:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2207 transitions. [2019-10-02 21:03:43,475 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2207 transitions. Word has length 369 [2019-10-02 21:03:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:03:43,475 INFO L475 AbstractCegarLoop]: Abstraction has 1686 states and 2207 transitions. [2019-10-02 21:03:43,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 21:03:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2207 transitions. [2019-10-02 21:03:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-10-02 21:03:43,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:03:43,485 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:03:43,485 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:03:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:03:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1363268673, now seen corresponding path program 1 times [2019-10-02 21:03:43,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:03:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:03:43,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:03:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:03:43,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:03:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:03:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 174 proven. 222 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 21:03:44,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:03:44,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:03:44,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: [2019-10-02 21:03:44,088 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [726], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 21:03:44,094 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:03:44,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:04:04,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:04:04,423 INFO L272 AbstractInterpreter]: Visited 136 different actions 267 times. Merged at 4 different actions 5 times. Never widened. Performed 625 root evaluator evaluations with a maximum evaluation depth of 13. Performed 625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 21:04:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:04:04,424 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:04:21,260 INFO L227 lantSequenceWeakener]: Weakened 392 states. On average, predicates are now at 77.61% of their original sizes. [2019-10-02 21:04:21,261 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:04:21,341 INFO L420 sIntCurrentIteration]: We unified 394 AI predicates to 394 [2019-10-02 21:04:21,342 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:04:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:04:21,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 21:04:21,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:04:21,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 21:04:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 21:04:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 21:04:21,344 INFO L87 Difference]: Start difference. First operand 1686 states and 2207 transitions. Second operand 11 states. [2019-10-02 21:05:02,233 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 21:07:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:07:38,443 INFO L93 Difference]: Finished difference Result 1690 states and 2197 transitions. [2019-10-02 21:07:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 21:07:38,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 395 [2019-10-02 21:07:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:07:38,450 INFO L225 Difference]: With dead ends: 1690 [2019-10-02 21:07:38,451 INFO L226 Difference]: Without dead ends: 1690 [2019-10-02 21:07:38,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 21:07:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-10-02 21:07:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1688. [2019-10-02 21:07:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2019-10-02 21:07:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2195 transitions. [2019-10-02 21:07:38,486 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2195 transitions. Word has length 395 [2019-10-02 21:07:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:07:38,487 INFO L475 AbstractCegarLoop]: Abstraction has 1688 states and 2195 transitions. [2019-10-02 21:07:38,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 21:07:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2195 transitions. [2019-10-02 21:07:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 21:07:38,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:07:38,497 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:07:38,497 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:07:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:07:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -748059746, now seen corresponding path program 1 times [2019-10-02 21:07:38,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:07:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:07:38,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:07:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:07:38,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:07:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:07:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 297 proven. 42 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 21:07:38,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:07:38,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:07:38,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 439 with the following transitions: [2019-10-02 21:07:38,891 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [910], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 21:07:38,895 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:07:38,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:08:03,859 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 21:09:12,024 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:09:12,025 INFO L272 AbstractInterpreter]: Visited 182 different actions 717 times. Merged at 6 different actions 19 times. Never widened. Performed 1624 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 21:09:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:09:12,025 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:09:38,730 INFO L227 lantSequenceWeakener]: Weakened 435 states. On average, predicates are now at 77.58% of their original sizes. [2019-10-02 21:09:38,730 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:09:38,889 INFO L420 sIntCurrentIteration]: We unified 437 AI predicates to 437 [2019-10-02 21:09:38,889 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:09:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:09:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2019-10-02 21:09:38,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:09:38,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 21:09:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 21:09:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 21:09:38,892 INFO L87 Difference]: Start difference. First operand 1688 states and 2195 transitions. Second operand 13 states.