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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:01:47,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:01:47,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:01:47,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:01:47,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:01:47,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:01:47,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:01:47,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:01:47,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:01:47,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:01:47,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:01:47,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:01:47,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:01:47,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:01:47,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:01:47,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:01:47,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:01:47,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:01:47,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:01:47,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:01:47,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:01:47,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:01:47,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:01:47,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:01:47,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:01:47,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:01:47,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:01:47,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:01:47,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:01:47,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:01:47,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:01:47,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:01:47,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:01:47,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:01:47,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:01:47,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:01:47,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:01:47,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:01:47,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:01:47,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:01:47,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:01:48,000 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-08 11:01:48,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:01:48,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:01:48,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:01:48,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:01:48,026 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:01:48,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:01:48,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:01:48,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:01:48,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:01:48,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:01:48,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:01:48,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:01:48,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:01:48,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:01:48,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:01:48,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:01:48,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:01:48,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:01:48,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:01:48,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:01:48,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:01:48,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:01:48,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:01:48,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:01:48,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:01:48,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:01:48,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:01:48,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:01:48,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:01:48,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:01:48,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:01:48,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:01:48,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:01:48,078 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:01:48,078 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:01:48,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e807968a1/2bd900d0900840dc924810cdc5e4e9c6/FLAG82f20d734 [2019-09-08 11:01:48,633 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:01:48,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:01:48,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e807968a1/2bd900d0900840dc924810cdc5e4e9c6/FLAG82f20d734 [2019-09-08 11:01:48,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e807968a1/2bd900d0900840dc924810cdc5e4e9c6 [2019-09-08 11:01:48,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:01:48,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:01:48,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:01:48,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:01:48,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:01:49,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:01:48" (1/1) ... [2019-09-08 11:01:49,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49, skipping insertion in model container [2019-09-08 11:01:49,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:01:48" (1/1) ... [2019-09-08 11:01:49,009 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:01:49,072 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:01:49,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:01:49,557 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:01:49,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:01:49,707 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:01:49,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49 WrapperNode [2019-09-08 11:01:49,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:01:49,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:01:49,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:01:49,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:01:49,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (1/1) ... [2019-09-08 11:01:49,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:01:49,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:01:49,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:01:49,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:01:49,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (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-08 11:01:49,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:01:49,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:01:49,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:01:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:01:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:01:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:01:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:01:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:01:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:01:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:01:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:01:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:01:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:01:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:01:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:01:51,003 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:01:51,003 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:01:51,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:01:51 BoogieIcfgContainer [2019-09-08 11:01:51,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:01:51,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:01:51,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:01:51,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:01:51,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:01:48" (1/3) ... [2019-09-08 11:01:51,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef9d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:01:51, skipping insertion in model container [2019-09-08 11:01:51,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:49" (2/3) ... [2019-09-08 11:01:51,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef9d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:01:51, skipping insertion in model container [2019-09-08 11:01:51,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:01:51" (3/3) ... [2019-09-08 11:01:51,032 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:01:51,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:01:51,051 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:01:51,067 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:01:51,097 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:01:51,097 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:01:51,097 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:01:51,098 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:01:51,098 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:01:51,098 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:01:51,098 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:01:51,098 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:01:51,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:01:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2019-09-08 11:01:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:01:51,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:51,135 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, 1, 1, 1, 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-08 11:01:51,137 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1388414232, now seen corresponding path program 1 times [2019-09-08 11:01:51,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:51,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:51,629 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-08 11:01:51,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:51,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:51,655 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2019-09-08 11:01:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:51,866 INFO L93 Difference]: Finished difference Result 444 states and 727 transitions. [2019-09-08 11:01:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:51,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 11:01:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:51,887 INFO L225 Difference]: With dead ends: 444 [2019-09-08 11:01:51,887 INFO L226 Difference]: Without dead ends: 333 [2019-09-08 11:01:51,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-08 11:01:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-09-08 11:01:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-08 11:01:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2019-09-08 11:01:51,983 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 85 [2019-09-08 11:01:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:51,984 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2019-09-08 11:01:51,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2019-09-08 11:01:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:01:51,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:51,988 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, 1, 1, 1, 1, 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-08 11:01:51,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -368286742, now seen corresponding path program 1 times [2019-09-08 11:01:51,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:52,368 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-08 11:01:52,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:52,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:01:52,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:01:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:01:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:52,373 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand 7 states. [2019-09-08 11:01:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:52,803 INFO L93 Difference]: Finished difference Result 1417 states and 2185 transitions. [2019-09-08 11:01:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:01:52,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 11:01:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:52,811 INFO L225 Difference]: With dead ends: 1417 [2019-09-08 11:01:52,812 INFO L226 Difference]: Without dead ends: 1171 [2019-09-08 11:01:52,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-08 11:01:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-09-08 11:01:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-09-08 11:01:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1786 transitions. [2019-09-08 11:01:52,911 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1786 transitions. Word has length 86 [2019-09-08 11:01:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:52,912 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1786 transitions. [2019-09-08 11:01:52,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:01:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1786 transitions. [2019-09-08 11:01:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:52,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:52,920 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, 1, 1, 1, 1, 1, 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-08 11:01:52,920 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -414926669, now seen corresponding path program 1 times [2019-09-08 11:01:52,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:53,048 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-08 11:01:53,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:01:53,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:01:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:01:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:01:53,050 INFO L87 Difference]: Start difference. First operand 1163 states and 1786 transitions. Second operand 5 states. [2019-09-08 11:01:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:53,567 INFO L93 Difference]: Finished difference Result 3010 states and 4682 transitions. [2019-09-08 11:01:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:53,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:01:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:53,584 INFO L225 Difference]: With dead ends: 3010 [2019-09-08 11:01:53,585 INFO L226 Difference]: Without dead ends: 1963 [2019-09-08 11:01:53,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-08 11:01:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2019-09-08 11:01:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-09-08 11:01:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3028 transitions. [2019-09-08 11:01:53,719 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3028 transitions. Word has length 87 [2019-09-08 11:01:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:53,719 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 3028 transitions. [2019-09-08 11:01:53,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:01:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3028 transitions. [2019-09-08 11:01:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:53,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:53,725 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, 1, 1, 1, 1, 1, 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-08 11:01:53,726 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash 412481220, now seen corresponding path program 1 times [2019-09-08 11:01:53,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:53,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:53,843 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-08 11:01:53,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:01:53,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:01:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:01:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:01:53,845 INFO L87 Difference]: Start difference. First operand 1961 states and 3028 transitions. Second operand 5 states. [2019-09-08 11:01:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:54,364 INFO L93 Difference]: Finished difference Result 5354 states and 8355 transitions. [2019-09-08 11:01:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:54,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:01:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:54,387 INFO L225 Difference]: With dead ends: 5354 [2019-09-08 11:01:54,387 INFO L226 Difference]: Without dead ends: 3543 [2019-09-08 11:01:54,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-09-08 11:01:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3541. [2019-09-08 11:01:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-09-08 11:01:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5493 transitions. [2019-09-08 11:01:54,677 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5493 transitions. Word has length 87 [2019-09-08 11:01:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:54,677 INFO L475 AbstractCegarLoop]: Abstraction has 3541 states and 5493 transitions. [2019-09-08 11:01:54,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:01:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5493 transitions. [2019-09-08 11:01:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:54,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:54,681 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, 1, 1, 1, 1, 1, 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-08 11:01:54,682 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash 549004962, now seen corresponding path program 1 times [2019-09-08 11:01:54,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:54,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:54,815 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-08 11:01:54,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:01:54,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:01:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:01:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:01:54,818 INFO L87 Difference]: Start difference. First operand 3541 states and 5493 transitions. Second operand 5 states. [2019-09-08 11:01:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:55,539 INFO L93 Difference]: Finished difference Result 10212 states and 15918 transitions. [2019-09-08 11:01:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:55,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:01:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:55,575 INFO L225 Difference]: With dead ends: 10212 [2019-09-08 11:01:55,576 INFO L226 Difference]: Without dead ends: 6757 [2019-09-08 11:01:55,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-09-08 11:01:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6755. [2019-09-08 11:01:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2019-09-08 11:01:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 10471 transitions. [2019-09-08 11:01:56,027 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 10471 transitions. Word has length 87 [2019-09-08 11:01:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:56,029 INFO L475 AbstractCegarLoop]: Abstraction has 6755 states and 10471 transitions. [2019-09-08 11:01:56,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:01:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 10471 transitions. [2019-09-08 11:01:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:56,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:56,039 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, 1, 1, 1, 1, 1, 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-08 11:01:56,039 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1246527343, now seen corresponding path program 1 times [2019-09-08 11:01:56,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:56,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:56,200 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-08 11:01:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:56,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:01:56,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:01:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:01:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:01:56,202 INFO L87 Difference]: Start difference. First operand 6755 states and 10471 transitions. Second operand 6 states. [2019-09-08 11:01:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:57,830 INFO L93 Difference]: Finished difference Result 25923 states and 40254 transitions. [2019-09-08 11:01:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:57,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-08 11:01:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:57,923 INFO L225 Difference]: With dead ends: 25923 [2019-09-08 11:01:57,924 INFO L226 Difference]: Without dead ends: 19231 [2019-09-08 11:01:57,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:01:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-08 11:01:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 19227. [2019-09-08 11:01:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-09-08 11:01:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 29724 transitions. [2019-09-08 11:01:59,008 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 29724 transitions. Word has length 87 [2019-09-08 11:01:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:59,010 INFO L475 AbstractCegarLoop]: Abstraction has 19227 states and 29724 transitions. [2019-09-08 11:01:59,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:01:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 29724 transitions. [2019-09-08 11:01:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:59,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:59,017 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, 1, 1, 1, 1, 1, 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-08 11:01:59,017 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1749809536, now seen corresponding path program 1 times [2019-09-08 11:01:59,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:59,117 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-08 11:01:59,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:59,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:01:59,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:01:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:01:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:01:59,120 INFO L87 Difference]: Start difference. First operand 19227 states and 29724 transitions. Second operand 5 states. [2019-09-08 11:02:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:01,350 INFO L93 Difference]: Finished difference Result 57291 states and 88652 transitions. [2019-09-08 11:02:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:01,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:02:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:01,455 INFO L225 Difference]: With dead ends: 57291 [2019-09-08 11:02:01,456 INFO L226 Difference]: Without dead ends: 38111 [2019-09-08 11:02:01,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38111 states. [2019-09-08 11:02:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38111 to 38109. [2019-09-08 11:02:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38109 states. [2019-09-08 11:02:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38109 states to 38109 states and 58544 transitions. [2019-09-08 11:02:03,412 INFO L78 Accepts]: Start accepts. Automaton has 38109 states and 58544 transitions. Word has length 87 [2019-09-08 11:02:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:03,413 INFO L475 AbstractCegarLoop]: Abstraction has 38109 states and 58544 transitions. [2019-09-08 11:02:03,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38109 states and 58544 transitions. [2019-09-08 11:02:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:02:03,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:03,422 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, 1, 1, 1, 1, 1, 1, 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-08 11:02:03,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1607364171, now seen corresponding path program 1 times [2019-09-08 11:02:03,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:03,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:03,524 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-08 11:02:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:03,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:03,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:03,526 INFO L87 Difference]: Start difference. First operand 38109 states and 58544 transitions. Second operand 5 states. [2019-09-08 11:02:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:06,475 INFO L93 Difference]: Finished difference Result 71535 states and 109385 transitions. [2019-09-08 11:02:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:02:06,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-08 11:02:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:06,652 INFO L225 Difference]: With dead ends: 71535 [2019-09-08 11:02:06,653 INFO L226 Difference]: Without dead ends: 71533 [2019-09-08 11:02:06,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71533 states. [2019-09-08 11:02:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71533 to 38589. [2019-09-08 11:02:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38589 states. [2019-09-08 11:02:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38589 states to 38589 states and 59024 transitions. [2019-09-08 11:02:08,722 INFO L78 Accepts]: Start accepts. Automaton has 38589 states and 59024 transitions. Word has length 88 [2019-09-08 11:02:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:08,722 INFO L475 AbstractCegarLoop]: Abstraction has 38589 states and 59024 transitions. [2019-09-08 11:02:08,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38589 states and 59024 transitions. [2019-09-08 11:02:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:02:08,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:08,733 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, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:08,733 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1987865476, now seen corresponding path program 1 times [2019-09-08 11:02:08,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:08,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:09,005 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-08 11:02:09,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:09,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:02:09,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:02:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:02:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:02:09,007 INFO L87 Difference]: Start difference. First operand 38589 states and 59024 transitions. Second operand 10 states. [2019-09-08 11:02:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:16,492 INFO L93 Difference]: Finished difference Result 125248 states and 189225 transitions. [2019-09-08 11:02:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:02:16,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:02:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:16,768 INFO L225 Difference]: With dead ends: 125248 [2019-09-08 11:02:16,768 INFO L226 Difference]: Without dead ends: 112622 [2019-09-08 11:02:16,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:02:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112622 states. [2019-09-08 11:02:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112622 to 39176. [2019-09-08 11:02:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39176 states. [2019-09-08 11:02:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39176 states to 39176 states and 59889 transitions. [2019-09-08 11:02:20,979 INFO L78 Accepts]: Start accepts. Automaton has 39176 states and 59889 transitions. Word has length 89 [2019-09-08 11:02:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:20,979 INFO L475 AbstractCegarLoop]: Abstraction has 39176 states and 59889 transitions. [2019-09-08 11:02:20,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:02:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39176 states and 59889 transitions. [2019-09-08 11:02:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:02:20,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:20,989 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, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:20,989 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 812355556, now seen corresponding path program 1 times [2019-09-08 11:02:20,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:20,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:21,077 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-08 11:02:21,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:02:21,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:02:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:02:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:02:21,079 INFO L87 Difference]: Start difference. First operand 39176 states and 59889 transitions. Second operand 4 states. [2019-09-08 11:02:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:24,456 INFO L93 Difference]: Finished difference Result 109644 states and 167079 transitions. [2019-09-08 11:02:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:02:24,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 11:02:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:24,569 INFO L225 Difference]: With dead ends: 109644 [2019-09-08 11:02:24,570 INFO L226 Difference]: Without dead ends: 72138 [2019-09-08 11:02:24,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:02:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72138 states. [2019-09-08 11:02:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72138 to 72136. [2019-09-08 11:02:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72136 states. [2019-09-08 11:02:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72136 states to 72136 states and 109397 transitions. [2019-09-08 11:02:30,173 INFO L78 Accepts]: Start accepts. Automaton has 72136 states and 109397 transitions. Word has length 89 [2019-09-08 11:02:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:30,173 INFO L475 AbstractCegarLoop]: Abstraction has 72136 states and 109397 transitions. [2019-09-08 11:02:30,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:02:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 72136 states and 109397 transitions. [2019-09-08 11:02:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:02:30,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:30,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:30,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash 63635533, now seen corresponding path program 1 times [2019-09-08 11:02:30,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:30,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:30,245 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-08 11:02:30,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:30,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:30,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:30,247 INFO L87 Difference]: Start difference. First operand 72136 states and 109397 transitions. Second operand 3 states. [2019-09-08 11:02:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:34,292 INFO L93 Difference]: Finished difference Result 95782 states and 144991 transitions. [2019-09-08 11:02:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:34,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:02:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:34,413 INFO L225 Difference]: With dead ends: 95782 [2019-09-08 11:02:34,413 INFO L226 Difference]: Without dead ends: 78716 [2019-09-08 11:02:34,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78716 states. [2019-09-08 11:02:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78716 to 70910. [2019-09-08 11:02:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70910 states. [2019-09-08 11:02:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70910 states to 70910 states and 106085 transitions. [2019-09-08 11:02:40,383 INFO L78 Accepts]: Start accepts. Automaton has 70910 states and 106085 transitions. Word has length 90 [2019-09-08 11:02:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:40,384 INFO L475 AbstractCegarLoop]: Abstraction has 70910 states and 106085 transitions. [2019-09-08 11:02:40,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 70910 states and 106085 transitions. [2019-09-08 11:02:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:02:40,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:40,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:40,392 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1632884758, now seen corresponding path program 1 times [2019-09-08 11:02:40,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:40,461 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-08 11:02:40,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:40,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:40,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:40,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:40,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:40,463 INFO L87 Difference]: Start difference. First operand 70910 states and 106085 transitions. Second operand 3 states. [2019-09-08 11:02:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:45,370 INFO L93 Difference]: Finished difference Result 135394 states and 202565 transitions. [2019-09-08 11:02:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:45,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:02:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:45,481 INFO L225 Difference]: With dead ends: 135394 [2019-09-08 11:02:45,482 INFO L226 Difference]: Without dead ends: 89556 [2019-09-08 11:02:45,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89556 states. [2019-09-08 11:02:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89556 to 88798. [2019-09-08 11:02:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88798 states. [2019-09-08 11:02:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88798 states to 88798 states and 131053 transitions. [2019-09-08 11:02:53,106 INFO L78 Accepts]: Start accepts. Automaton has 88798 states and 131053 transitions. Word has length 90 [2019-09-08 11:02:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:53,107 INFO L475 AbstractCegarLoop]: Abstraction has 88798 states and 131053 transitions. [2019-09-08 11:02:53,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88798 states and 131053 transitions. [2019-09-08 11:02:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:02:53,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:53,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:02:53,116 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2017433619, now seen corresponding path program 1 times [2019-09-08 11:02:53,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:53,215 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-08 11:02:53,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:53,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:53,217 INFO L87 Difference]: Start difference. First operand 88798 states and 131053 transitions. Second operand 7 states. [2019-09-08 11:03:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:11,870 INFO L93 Difference]: Finished difference Result 299498 states and 435981 transitions. [2019-09-08 11:03:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:11,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:03:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:12,291 INFO L225 Difference]: With dead ends: 299498 [2019-09-08 11:03:12,292 INFO L226 Difference]: Without dead ends: 287916 [2019-09-08 11:03:12,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287916 states. [2019-09-08 11:03:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287916 to 102972. [2019-09-08 11:03:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102972 states. [2019-09-08 11:03:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102972 states to 102972 states and 151596 transitions. [2019-09-08 11:03:24,232 INFO L78 Accepts]: Start accepts. Automaton has 102972 states and 151596 transitions. Word has length 90 [2019-09-08 11:03:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:24,232 INFO L475 AbstractCegarLoop]: Abstraction has 102972 states and 151596 transitions. [2019-09-08 11:03:24,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102972 states and 151596 transitions. [2019-09-08 11:03:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:03:24,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:24,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:03:24,242 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1079490452, now seen corresponding path program 1 times [2019-09-08 11:03:24,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:24,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:24,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:24,302 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-08 11:03:24,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:24,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:03:24,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:03:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:03:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:24,304 INFO L87 Difference]: Start difference. First operand 102972 states and 151596 transitions. Second operand 3 states. [2019-09-08 11:03:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:33,218 INFO L93 Difference]: Finished difference Result 171326 states and 251576 transitions. [2019-09-08 11:03:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:03:33,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:03:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:33,366 INFO L225 Difference]: With dead ends: 171326 [2019-09-08 11:03:33,366 INFO L226 Difference]: Without dead ends: 114132 [2019-09-08 11:03:33,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114132 states. [2019-09-08 11:03:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114132 to 113206. [2019-09-08 11:03:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113206 states. [2019-09-08 11:03:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113206 states to 113206 states and 163715 transitions. [2019-09-08 11:03:44,346 INFO L78 Accepts]: Start accepts. Automaton has 113206 states and 163715 transitions. Word has length 90 [2019-09-08 11:03:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:44,346 INFO L475 AbstractCegarLoop]: Abstraction has 113206 states and 163715 transitions. [2019-09-08 11:03:44,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:03:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113206 states and 163715 transitions. [2019-09-08 11:03:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:03:44,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:44,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:03:44,357 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1593295700, now seen corresponding path program 1 times [2019-09-08 11:03:44,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:44,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:44,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:44,418 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-08 11:03:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:44,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:03:44,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:03:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:03:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:44,420 INFO L87 Difference]: Start difference. First operand 113206 states and 163715 transitions. Second operand 3 states. [2019-09-08 11:03:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:56,995 INFO L93 Difference]: Finished difference Result 263162 states and 380044 transitions. [2019-09-08 11:03:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:03:56,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:03:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:57,222 INFO L225 Difference]: With dead ends: 263162 [2019-09-08 11:03:57,223 INFO L226 Difference]: Without dead ends: 161508 [2019-09-08 11:03:57,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161508 states. [2019-09-08 11:04:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161508 to 160258. [2019-09-08 11:04:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160258 states. [2019-09-08 11:04:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160258 states to 160258 states and 228367 transitions. [2019-09-08 11:04:13,134 INFO L78 Accepts]: Start accepts. Automaton has 160258 states and 228367 transitions. Word has length 90 [2019-09-08 11:04:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:13,134 INFO L475 AbstractCegarLoop]: Abstraction has 160258 states and 228367 transitions. [2019-09-08 11:04:13,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 160258 states and 228367 transitions. [2019-09-08 11:04:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:04:13,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:13,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:04:13,146 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 327308374, now seen corresponding path program 1 times [2019-09-08 11:04:13,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:13,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:13,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:13,207 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-08 11:04:13,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:13,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:13,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:13,209 INFO L87 Difference]: Start difference. First operand 160258 states and 228367 transitions. Second operand 3 states. [2019-09-08 11:04:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:37,115 INFO L93 Difference]: Finished difference Result 427781 states and 608770 transitions. [2019-09-08 11:04:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:04:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:37,600 INFO L225 Difference]: With dead ends: 427781 [2019-09-08 11:04:37,601 INFO L226 Difference]: Without dead ends: 278387 [2019-09-08 11:04:37,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278387 states. [2019-09-08 11:05:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278387 to 277837. [2019-09-08 11:05:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277837 states. [2019-09-08 11:05:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277837 states to 277837 states and 391676 transitions. [2019-09-08 11:05:05,913 INFO L78 Accepts]: Start accepts. Automaton has 277837 states and 391676 transitions. Word has length 90 [2019-09-08 11:05:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:05,913 INFO L475 AbstractCegarLoop]: Abstraction has 277837 states and 391676 transitions. [2019-09-08 11:05:05,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 277837 states and 391676 transitions. [2019-09-08 11:05:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:05:05,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:05,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:05:05,934 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash 810633430, now seen corresponding path program 1 times [2019-09-08 11:05:05,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:06,024 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-08 11:05:06,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:06,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:05:06,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:05:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:05:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:06,025 INFO L87 Difference]: Start difference. First operand 277837 states and 391676 transitions. Second operand 7 states. [2019-09-08 11:07:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:25,076 INFO L93 Difference]: Finished difference Result 1603957 states and 2239041 transitions. [2019-09-08 11:07:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:25,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:07:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:28,385 INFO L225 Difference]: With dead ends: 1603957 [2019-09-08 11:07:28,385 INFO L226 Difference]: Without dead ends: 1476263 [2019-09-08 11:07:28,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:07:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476263 states. [2019-09-08 11:08:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476263 to 278411. [2019-09-08 11:08:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278411 states. [2019-09-08 11:08:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278411 states to 278411 states and 392416 transitions. [2019-09-08 11:08:17,394 INFO L78 Accepts]: Start accepts. Automaton has 278411 states and 392416 transitions. Word has length 90 [2019-09-08 11:08:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:17,394 INFO L475 AbstractCegarLoop]: Abstraction has 278411 states and 392416 transitions. [2019-09-08 11:08:17,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 278411 states and 392416 transitions. [2019-09-08 11:08:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:08:17,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:17,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:08:17,410 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash 108547188, now seen corresponding path program 1 times [2019-09-08 11:08:17,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:17,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:17,505 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-08 11:08:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:17,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:08:17,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:08:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:08:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:08:17,507 INFO L87 Difference]: Start difference. First operand 278411 states and 392416 transitions. Second operand 7 states. [2019-09-08 11:11:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:14,806 INFO L93 Difference]: Finished difference Result 1649446 states and 2308737 transitions. [2019-09-08 11:11:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:14,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:11:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:17,469 INFO L225 Difference]: With dead ends: 1649446 [2019-09-08 11:11:17,470 INFO L226 Difference]: Without dead ends: 1522720 [2019-09-08 11:11:17,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:11:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522720 states. [2019-09-08 11:12:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522720 to 278699. [2019-09-08 11:12:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278699 states. [2019-09-08 11:12:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278699 states to 278699 states and 392771 transitions. [2019-09-08 11:12:13,567 INFO L78 Accepts]: Start accepts. Automaton has 278699 states and 392771 transitions. Word has length 90 [2019-09-08 11:12:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:13,567 INFO L475 AbstractCegarLoop]: Abstraction has 278699 states and 392771 transitions. [2019-09-08 11:12:13,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 278699 states and 392771 transitions. [2019-09-08 11:12:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:12:13,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:13,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:12:13,582 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1883359786, now seen corresponding path program 1 times [2019-09-08 11:12:13,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:13,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:13,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:13,684 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-08 11:12:13,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:13,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:12:13,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:12:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:12:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:13,688 INFO L87 Difference]: Start difference. First operand 278699 states and 392771 transitions. Second operand 7 states.