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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:10:00,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:10:00,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:10:00,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:10:00,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:10:00,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:10:00,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:10:00,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:10:00,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:10:00,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:10:00,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:10:00,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:10:00,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:10:00,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:10:00,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:10:00,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:10:00,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:10:00,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:10:00,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:10:00,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:10:00,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:10:00,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:10:00,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:10:00,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:10:00,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:10:00,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:10:00,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:10:00,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:10:00,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:10:00,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:10:00,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:10:00,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:10:00,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:10:00,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:10:00,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:10:00,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:10:00,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:10:00,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:10:00,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:10:00,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:10:00,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:10:00,972 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:10:00,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:10:00,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:10:00,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:10:00,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:10:00,988 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:10:00,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:10:00,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:10:00,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:10:00,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:10:00,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:10:00,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:10:00,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:10:00,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:10:00,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:10:00,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:10:00,990 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:10:00,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:10:00,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:10:00,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:10:00,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:10:00,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:10:00,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:10:00,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:10:00,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:10:00,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:10:00,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:10:00,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:10:00,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:10:00,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:10:01,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:10:01,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:10:01,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:10:01,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:10:01,036 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:10:01,036 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:10:01,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63a4b2b/524ee571d563454dbca9abd5f6a07e35/FLAGf3b38518d [2019-09-08 11:10:01,807 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:10:01,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:10:01,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63a4b2b/524ee571d563454dbca9abd5f6a07e35/FLAGf3b38518d [2019-09-08 11:10:01,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b63a4b2b/524ee571d563454dbca9abd5f6a07e35 [2019-09-08 11:10:01,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:10:01,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:10:01,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:10:01,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:10:01,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:10:01,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:01" (1/1) ... [2019-09-08 11:10:01,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37de91cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:01, skipping insertion in model container [2019-09-08 11:10:01,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:01" (1/1) ... [2019-09-08 11:10:01,954 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:10:02,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:10:03,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:10:03,482 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:10:04,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:10:04,150 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:10:04,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04 WrapperNode [2019-09-08 11:10:04,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:10:04,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:10:04,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:10:04,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:10:04,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (1/1) ... [2019-09-08 11:10:04,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:10:04,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:10:04,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:10:04,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:10:04,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (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:10:04,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:10:04,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:10:04,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:10:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:10:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:10:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:10:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:10:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:10:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:10:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:10:09,008 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:10:09,008 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:10:09,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:09 BoogieIcfgContainer [2019-09-08 11:10:09,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:10:09,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:10:09,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:10:09,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:10:09,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:10:01" (1/3) ... [2019-09-08 11:10:09,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bdf98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:09, skipping insertion in model container [2019-09-08 11:10:09,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:04" (2/3) ... [2019-09-08 11:10:09,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bdf98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:09, skipping insertion in model container [2019-09-08 11:10:09,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:09" (3/3) ... [2019-09-08 11:10:09,018 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:10:09,028 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:10:09,037 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 11:10:09,054 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 11:10:09,093 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:10:09,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:10:09,094 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:10:09,094 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:10:09,094 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:10:09,094 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:10:09,094 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:10:09,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:10:09,094 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:10:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states. [2019-09-08 11:10:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:10:09,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:09,162 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] [2019-09-08 11:10:09,165 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1130325089, now seen corresponding path program 1 times [2019-09-08 11:10:09,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:09,910 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:10:09,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:09,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:09,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:09,935 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand 3 states. [2019-09-08 11:10:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:10,128 INFO L93 Difference]: Finished difference Result 2326 states and 4096 transitions. [2019-09-08 11:10:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:10,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:10:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:10,165 INFO L225 Difference]: With dead ends: 2326 [2019-09-08 11:10:10,166 INFO L226 Difference]: Without dead ends: 1979 [2019-09-08 11:10:10,178 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:10:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-08 11:10:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1969. [2019-09-08 11:10:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-09-08 11:10:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2655 transitions. [2019-09-08 11:10:10,346 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2655 transitions. Word has length 79 [2019-09-08 11:10:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:10,347 INFO L475 AbstractCegarLoop]: Abstraction has 1969 states and 2655 transitions. [2019-09-08 11:10:10,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2655 transitions. [2019-09-08 11:10:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:10:10,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:10,359 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] [2019-09-08 11:10:10,359 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash 525516661, now seen corresponding path program 1 times [2019-09-08 11:10:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:10,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:10,705 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:10:10,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:10,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:10:10,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:10:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:10:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:10:10,709 INFO L87 Difference]: Start difference. First operand 1969 states and 2655 transitions. Second operand 6 states. [2019-09-08 11:10:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:12,199 INFO L93 Difference]: Finished difference Result 3713 states and 5197 transitions. [2019-09-08 11:10:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:12,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-08 11:10:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:12,210 INFO L225 Difference]: With dead ends: 3713 [2019-09-08 11:10:12,210 INFO L226 Difference]: Without dead ends: 2254 [2019-09-08 11:10:12,215 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:10:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2019-09-08 11:10:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2234. [2019-09-08 11:10:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-09-08 11:10:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3172 transitions. [2019-09-08 11:10:12,291 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3172 transitions. Word has length 79 [2019-09-08 11:10:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:12,294 INFO L475 AbstractCegarLoop]: Abstraction has 2234 states and 3172 transitions. [2019-09-08 11:10:12,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:10:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3172 transitions. [2019-09-08 11:10:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:10:12,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:12,301 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] [2019-09-08 11:10:12,301 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825525, now seen corresponding path program 1 times [2019-09-08 11:10:12,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:12,506 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:10:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:12,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:12,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:12,508 INFO L87 Difference]: Start difference. First operand 2234 states and 3172 transitions. Second operand 5 states. [2019-09-08 11:10:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:13,750 INFO L93 Difference]: Finished difference Result 4689 states and 6849 transitions. [2019-09-08 11:10:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:13,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 11:10:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:13,779 INFO L225 Difference]: With dead ends: 4689 [2019-09-08 11:10:13,788 INFO L226 Difference]: Without dead ends: 2837 [2019-09-08 11:10:13,793 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:10:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2019-09-08 11:10:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2827. [2019-09-08 11:10:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-09-08 11:10:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4136 transitions. [2019-09-08 11:10:13,962 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4136 transitions. Word has length 80 [2019-09-08 11:10:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:13,964 INFO L475 AbstractCegarLoop]: Abstraction has 2827 states and 4136 transitions. [2019-09-08 11:10:13,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4136 transitions. [2019-09-08 11:10:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:10:13,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:13,970 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] [2019-09-08 11:10:13,970 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1374038338, now seen corresponding path program 1 times [2019-09-08 11:10:13,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:13,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:14,122 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:10:14,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:14,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:14,125 INFO L87 Difference]: Start difference. First operand 2827 states and 4136 transitions. Second operand 3 states. [2019-09-08 11:10:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:14,301 INFO L93 Difference]: Finished difference Result 5712 states and 8475 transitions. [2019-09-08 11:10:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:14,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:10:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:14,324 INFO L225 Difference]: With dead ends: 5712 [2019-09-08 11:10:14,324 INFO L226 Difference]: Without dead ends: 3989 [2019-09-08 11:10:14,333 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:10:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2019-09-08 11:10:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3973. [2019-09-08 11:10:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-09-08 11:10:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5772 transitions. [2019-09-08 11:10:14,584 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5772 transitions. Word has length 81 [2019-09-08 11:10:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:14,585 INFO L475 AbstractCegarLoop]: Abstraction has 3973 states and 5772 transitions. [2019-09-08 11:10:14,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5772 transitions. [2019-09-08 11:10:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:10:14,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:14,597 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] [2019-09-08 11:10:14,598 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 172328457, now seen corresponding path program 1 times [2019-09-08 11:10:14,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:14,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:14,732 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:10:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:14,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:14,735 INFO L87 Difference]: Start difference. First operand 3973 states and 5772 transitions. Second operand 3 states. [2019-09-08 11:10:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:15,016 INFO L93 Difference]: Finished difference Result 8863 states and 13135 transitions. [2019-09-08 11:10:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:15,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:10:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:15,049 INFO L225 Difference]: With dead ends: 8863 [2019-09-08 11:10:15,050 INFO L226 Difference]: Without dead ends: 6234 [2019-09-08 11:10:15,058 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:10:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-09-08 11:10:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6224. [2019-09-08 11:10:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-09-08 11:10:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 9062 transitions. [2019-09-08 11:10:15,392 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 9062 transitions. Word has length 81 [2019-09-08 11:10:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:15,393 INFO L475 AbstractCegarLoop]: Abstraction has 6224 states and 9062 transitions. [2019-09-08 11:10:15,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 9062 transitions. [2019-09-08 11:10:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:10:15,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:15,402 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] [2019-09-08 11:10:15,402 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1024463430, now seen corresponding path program 1 times [2019-09-08 11:10:15,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:15,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:15,517 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:10:15,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:15,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:15,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:15,519 INFO L87 Difference]: Start difference. First operand 6224 states and 9062 transitions. Second operand 3 states. [2019-09-08 11:10:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:15,976 INFO L93 Difference]: Finished difference Result 14522 states and 21241 transitions. [2019-09-08 11:10:15,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:15,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:10:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:16,027 INFO L225 Difference]: With dead ends: 14522 [2019-09-08 11:10:16,028 INFO L226 Difference]: Without dead ends: 10689 [2019-09-08 11:10:16,039 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:10:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2019-09-08 11:10:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 10679. [2019-09-08 11:10:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10679 states. [2019-09-08 11:10:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10679 states to 10679 states and 15318 transitions. [2019-09-08 11:10:16,611 INFO L78 Accepts]: Start accepts. Automaton has 10679 states and 15318 transitions. Word has length 81 [2019-09-08 11:10:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:16,612 INFO L475 AbstractCegarLoop]: Abstraction has 10679 states and 15318 transitions. [2019-09-08 11:10:16,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10679 states and 15318 transitions. [2019-09-08 11:10:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:10:16,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:16,624 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] [2019-09-08 11:10:16,624 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash 214825384, now seen corresponding path program 1 times [2019-09-08 11:10:16,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:16,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:16,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:16,732 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:10:16,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:16,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:16,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:16,733 INFO L87 Difference]: Start difference. First operand 10679 states and 15318 transitions. Second operand 3 states. [2019-09-08 11:10:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:17,179 INFO L93 Difference]: Finished difference Result 23664 states and 34287 transitions. [2019-09-08 11:10:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:17,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:10:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:17,217 INFO L225 Difference]: With dead ends: 23664 [2019-09-08 11:10:17,217 INFO L226 Difference]: Without dead ends: 15388 [2019-09-08 11:10:17,238 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:10:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15388 states. [2019-09-08 11:10:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15388 to 15330. [2019-09-08 11:10:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15330 states. [2019-09-08 11:10:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15330 states to 15330 states and 21897 transitions. [2019-09-08 11:10:17,894 INFO L78 Accepts]: Start accepts. Automaton has 15330 states and 21897 transitions. Word has length 81 [2019-09-08 11:10:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:17,895 INFO L475 AbstractCegarLoop]: Abstraction has 15330 states and 21897 transitions. [2019-09-08 11:10:17,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 15330 states and 21897 transitions. [2019-09-08 11:10:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:10:17,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:17,915 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] [2019-09-08 11:10:17,915 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 944670416, now seen corresponding path program 1 times [2019-09-08 11:10:17,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:18,071 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:10:18,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:18,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:18,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:18,073 INFO L87 Difference]: Start difference. First operand 15330 states and 21897 transitions. Second operand 5 states. [2019-09-08 11:10:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:19,693 INFO L93 Difference]: Finished difference Result 34513 states and 49622 transitions. [2019-09-08 11:10:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:19,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 11:10:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:19,738 INFO L225 Difference]: With dead ends: 34513 [2019-09-08 11:10:19,738 INFO L226 Difference]: Without dead ends: 20153 [2019-09-08 11:10:19,767 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:10:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20153 states. [2019-09-08 11:10:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20153 to 20083. [2019-09-08 11:10:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20083 states. [2019-09-08 11:10:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20083 states to 20083 states and 28708 transitions. [2019-09-08 11:10:21,525 INFO L78 Accepts]: Start accepts. Automaton has 20083 states and 28708 transitions. Word has length 81 [2019-09-08 11:10:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:21,526 INFO L475 AbstractCegarLoop]: Abstraction has 20083 states and 28708 transitions. [2019-09-08 11:10:21,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20083 states and 28708 transitions. [2019-09-08 11:10:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:10:21,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:21,542 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] [2019-09-08 11:10:21,542 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1273711453, now seen corresponding path program 1 times [2019-09-08 11:10:21,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:21,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:21,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:21,702 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:10:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:21,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:21,704 INFO L87 Difference]: Start difference. First operand 20083 states and 28708 transitions. Second operand 7 states. [2019-09-08 11:10:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:25,356 INFO L93 Difference]: Finished difference Result 77102 states and 112085 transitions. [2019-09-08 11:10:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:25,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-08 11:10:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:25,511 INFO L225 Difference]: With dead ends: 77102 [2019-09-08 11:10:25,512 INFO L226 Difference]: Without dead ends: 70544 [2019-09-08 11:10:25,545 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:10:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70544 states. [2019-09-08 11:10:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70544 to 20131. [2019-09-08 11:10:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20131 states. [2019-09-08 11:10:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 28772 transitions. [2019-09-08 11:10:27,684 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 28772 transitions. Word has length 82 [2019-09-08 11:10:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:27,684 INFO L475 AbstractCegarLoop]: Abstraction has 20131 states and 28772 transitions. [2019-09-08 11:10:27,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:10:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 28772 transitions. [2019-09-08 11:10:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:10:27,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:27,698 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] [2019-09-08 11:10:27,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1971603743, now seen corresponding path program 1 times [2019-09-08 11:10:27,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:27,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:27,836 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:10:27,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:27,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:27,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:27,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:27,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:27,837 INFO L87 Difference]: Start difference. First operand 20131 states and 28772 transitions. Second operand 7 states. [2019-09-08 11:10:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:32,971 INFO L93 Difference]: Finished difference Result 83305 states and 121141 transitions. [2019-09-08 11:10:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:32,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-08 11:10:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:33,120 INFO L225 Difference]: With dead ends: 83305 [2019-09-08 11:10:33,123 INFO L226 Difference]: Without dead ends: 75471 [2019-09-08 11:10:33,153 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:10:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75471 states. [2019-09-08 11:10:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75471 to 20311. [2019-09-08 11:10:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20311 states. [2019-09-08 11:10:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20311 states to 20311 states and 29012 transitions. [2019-09-08 11:10:35,484 INFO L78 Accepts]: Start accepts. Automaton has 20311 states and 29012 transitions. Word has length 82 [2019-09-08 11:10:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:35,484 INFO L475 AbstractCegarLoop]: Abstraction has 20311 states and 29012 transitions. [2019-09-08 11:10:35,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:10:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 20311 states and 29012 transitions. [2019-09-08 11:10:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:10:35,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:35,497 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] [2019-09-08 11:10:35,497 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1732967850, now seen corresponding path program 1 times [2019-09-08 11:10:35,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:35,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:35,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:35,627 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:10:35,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:35,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:35,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:35,629 INFO L87 Difference]: Start difference. First operand 20311 states and 29012 transitions. Second operand 7 states. [2019-09-08 11:10:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:41,115 INFO L93 Difference]: Finished difference Result 82731 states and 120411 transitions. [2019-09-08 11:10:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:41,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-08 11:10:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:41,268 INFO L225 Difference]: With dead ends: 82731 [2019-09-08 11:10:41,269 INFO L226 Difference]: Without dead ends: 74157 [2019-09-08 11:10:41,308 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:10:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74157 states. [2019-09-08 11:10:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74157 to 20679. [2019-09-08 11:10:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20679 states. [2019-09-08 11:10:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20679 states to 20679 states and 29504 transitions. [2019-09-08 11:10:42,964 INFO L78 Accepts]: Start accepts. Automaton has 20679 states and 29504 transitions. Word has length 82 [2019-09-08 11:10:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:42,964 INFO L475 AbstractCegarLoop]: Abstraction has 20679 states and 29504 transitions. [2019-09-08 11:10:42,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:10:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 20679 states and 29504 transitions. [2019-09-08 11:10:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:10:42,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:42,976 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] [2019-09-08 11:10:42,976 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash 3049635, now seen corresponding path program 1 times [2019-09-08 11:10:42,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:42,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:42,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:43,113 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:10:43,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:43,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:10:43,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:10:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:10:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:10:43,115 INFO L87 Difference]: Start difference. First operand 20679 states and 29504 transitions. Second operand 4 states. [2019-09-08 11:10:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:44,967 INFO L93 Difference]: Finished difference Result 32615 states and 47229 transitions. [2019-09-08 11:10:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:10:44,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-08 11:10:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:45,016 INFO L225 Difference]: With dead ends: 32615 [2019-09-08 11:10:45,016 INFO L226 Difference]: Without dead ends: 32613 [2019-09-08 11:10:45,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:10:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32613 states. [2019-09-08 11:10:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32613 to 20677. [2019-09-08 11:10:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-09-08 11:10:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 29455 transitions. [2019-09-08 11:10:47,181 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 29455 transitions. Word has length 83 [2019-09-08 11:10:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:47,181 INFO L475 AbstractCegarLoop]: Abstraction has 20677 states and 29455 transitions. [2019-09-08 11:10:47,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:10:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 29455 transitions. [2019-09-08 11:10:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:10:47,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:47,191 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] [2019-09-08 11:10:47,191 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1627572410, now seen corresponding path program 1 times [2019-09-08 11:10:47,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:47,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:47,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:47,318 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:10:47,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:10:47,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:10:47,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:10:47,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:10:47,320 INFO L87 Difference]: Start difference. First operand 20677 states and 29455 transitions. Second operand 4 states. [2019-09-08 11:10:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:49,113 INFO L93 Difference]: Finished difference Result 32613 states and 47180 transitions. [2019-09-08 11:10:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:10:49,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-08 11:10:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:49,150 INFO L225 Difference]: With dead ends: 32613 [2019-09-08 11:10:49,150 INFO L226 Difference]: Without dead ends: 32611 [2019-09-08 11:10:49,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:10:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32611 states. [2019-09-08 11:10:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32611 to 20675. [2019-09-08 11:10:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20675 states. [2019-09-08 11:10:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20675 states to 20675 states and 29406 transitions. [2019-09-08 11:10:50,457 INFO L78 Accepts]: Start accepts. Automaton has 20675 states and 29406 transitions. Word has length 83 [2019-09-08 11:10:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:50,457 INFO L475 AbstractCegarLoop]: Abstraction has 20675 states and 29406 transitions. [2019-09-08 11:10:50,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:10:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20675 states and 29406 transitions. [2019-09-08 11:10:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:10:50,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:50,467 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] [2019-09-08 11:10:50,468 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1762698258, now seen corresponding path program 1 times [2019-09-08 11:10:50,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:50,575 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:10:50,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:50,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:50,578 INFO L87 Difference]: Start difference. First operand 20675 states and 29406 transitions. Second operand 5 states. [2019-09-08 11:10:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:53,349 INFO L93 Difference]: Finished difference Result 47256 states and 67259 transitions. [2019-09-08 11:10:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:53,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:10:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:53,380 INFO L225 Difference]: With dead ends: 47256 [2019-09-08 11:10:53,380 INFO L226 Difference]: Without dead ends: 27389 [2019-09-08 11:10:53,408 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:10:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27389 states. [2019-09-08 11:10:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27389 to 27293. [2019-09-08 11:10:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27293 states. [2019-09-08 11:10:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27293 states to 27293 states and 38550 transitions. [2019-09-08 11:10:55,328 INFO L78 Accepts]: Start accepts. Automaton has 27293 states and 38550 transitions. Word has length 83 [2019-09-08 11:10:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:55,329 INFO L475 AbstractCegarLoop]: Abstraction has 27293 states and 38550 transitions. [2019-09-08 11:10:55,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 27293 states and 38550 transitions. [2019-09-08 11:10:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:10:55,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:55,338 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] [2019-09-08 11:10:55,338 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1511631301, now seen corresponding path program 1 times [2019-09-08 11:10:55,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:55,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:55,447 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:10:55,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:55,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:55,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:55,449 INFO L87 Difference]: Start difference. First operand 27293 states and 38550 transitions. Second operand 5 states. [2019-09-08 11:10:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:59,596 INFO L93 Difference]: Finished difference Result 63992 states and 90684 transitions. [2019-09-08 11:10:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:59,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:10:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:59,631 INFO L225 Difference]: With dead ends: 63992 [2019-09-08 11:10:59,631 INFO L226 Difference]: Without dead ends: 37574 [2019-09-08 11:10:59,648 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:10:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37574 states. [2019-09-08 11:11:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37574 to 27293. [2019-09-08 11:11:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27293 states. [2019-09-08 11:11:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27293 states to 27293 states and 38414 transitions. [2019-09-08 11:11:01,471 INFO L78 Accepts]: Start accepts. Automaton has 27293 states and 38414 transitions. Word has length 83 [2019-09-08 11:11:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:01,472 INFO L475 AbstractCegarLoop]: Abstraction has 27293 states and 38414 transitions. [2019-09-08 11:11:01,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:11:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27293 states and 38414 transitions. [2019-09-08 11:11:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:11:01,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:01,480 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] [2019-09-08 11:11:01,481 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1805655940, now seen corresponding path program 1 times [2019-09-08 11:11:01,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:01,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:01,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:01,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:01,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:01,611 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:11:01,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:01,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:11:01,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:11:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:11:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:11:01,613 INFO L87 Difference]: Start difference. First operand 27293 states and 38414 transitions. Second operand 7 states. [2019-09-08 11:11:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:11,287 INFO L93 Difference]: Finished difference Result 105957 states and 151414 transitions. [2019-09-08 11:11:11,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:11,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-08 11:11:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:11,387 INFO L225 Difference]: With dead ends: 105957 [2019-09-08 11:11:11,388 INFO L226 Difference]: Without dead ends: 93815 [2019-09-08 11:11:11,416 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:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93815 states. [2019-09-08 11:11:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93815 to 27922. [2019-09-08 11:11:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27922 states. [2019-09-08 11:11:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27922 states to 27922 states and 39262 transitions. [2019-09-08 11:11:14,215 INFO L78 Accepts]: Start accepts. Automaton has 27922 states and 39262 transitions. Word has length 84 [2019-09-08 11:11:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:14,215 INFO L475 AbstractCegarLoop]: Abstraction has 27922 states and 39262 transitions. [2019-09-08 11:11:14,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:11:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27922 states and 39262 transitions. [2019-09-08 11:11:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:11:14,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:14,224 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] [2019-09-08 11:11:14,224 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1088887081, now seen corresponding path program 1 times [2019-09-08 11:11:14,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:14,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:14,349 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:11:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:11:14,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:11:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:11:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:11:14,351 INFO L87 Difference]: Start difference. First operand 27922 states and 39262 transitions. Second operand 7 states. [2019-09-08 11:11:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:24,861 INFO L93 Difference]: Finished difference Result 100460 states and 142872 transitions. [2019-09-08 11:11:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:24,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-08 11:11:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:24,965 INFO L225 Difference]: With dead ends: 100460 [2019-09-08 11:11:24,965 INFO L226 Difference]: Without dead ends: 86256 [2019-09-08 11:11:24,995 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:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86256 states. [2019-09-08 11:11:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86256 to 28006. [2019-09-08 11:11:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28006 states. [2019-09-08 11:11:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28006 states to 28006 states and 39370 transitions. [2019-09-08 11:11:27,818 INFO L78 Accepts]: Start accepts. Automaton has 28006 states and 39370 transitions. Word has length 84 [2019-09-08 11:11:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:27,818 INFO L475 AbstractCegarLoop]: Abstraction has 28006 states and 39370 transitions. [2019-09-08 11:11:27,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:11:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28006 states and 39370 transitions. [2019-09-08 11:11:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:11:27,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:27,828 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:11:27,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1538841626, now seen corresponding path program 1 times [2019-09-08 11:11:27,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:27,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:27,937 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:11:27,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:27,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:11:27,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:11:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:11:27,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:11:27,939 INFO L87 Difference]: Start difference. First operand 28006 states and 39370 transitions. Second operand 4 states. [2019-09-08 11:11:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:32,517 INFO L93 Difference]: Finished difference Result 45774 states and 65372 transitions. [2019-09-08 11:11:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:11:32,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 11:11:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:32,558 INFO L225 Difference]: With dead ends: 45774 [2019-09-08 11:11:32,558 INFO L226 Difference]: Without dead ends: 45772 [2019-09-08 11:11:32,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:11:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45772 states. [2019-09-08 11:11:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45772 to 28004. [2019-09-08 11:11:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28004 states. [2019-09-08 11:11:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28004 states to 28004 states and 39297 transitions. [2019-09-08 11:11:35,371 INFO L78 Accepts]: Start accepts. Automaton has 28004 states and 39297 transitions. Word has length 85 [2019-09-08 11:11:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:35,372 INFO L475 AbstractCegarLoop]: Abstraction has 28004 states and 39297 transitions. [2019-09-08 11:11:35,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:11:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 28004 states and 39297 transitions. [2019-09-08 11:11:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:11:35,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:35,381 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:11:35,381 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1051434301, now seen corresponding path program 1 times [2019-09-08 11:11:35,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:35,500 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:11:35,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:35,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:11:35,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:11:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:11:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:11:35,501 INFO L87 Difference]: Start difference. First operand 28004 states and 39297 transitions. Second operand 4 states. [2019-09-08 11:11:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:40,051 INFO L93 Difference]: Finished difference Result 45772 states and 65299 transitions. [2019-09-08 11:11:40,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:11:40,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 11:11:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:40,096 INFO L225 Difference]: With dead ends: 45772 [2019-09-08 11:11:40,096 INFO L226 Difference]: Without dead ends: 45770 [2019-09-08 11:11:40,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:11:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45770 states. [2019-09-08 11:11:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45770 to 28002. [2019-09-08 11:11:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-09-08 11:11:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 39242 transitions. [2019-09-08 11:11:43,805 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 39242 transitions. Word has length 85 [2019-09-08 11:11:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:43,805 INFO L475 AbstractCegarLoop]: Abstraction has 28002 states and 39242 transitions. [2019-09-08 11:11:43,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:11:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 39242 transitions. [2019-09-08 11:11:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:11:43,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:43,819 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:11:43,819 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash 262116288, now seen corresponding path program 1 times [2019-09-08 11:11:43,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:43,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:44,010 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:11:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:11:44,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:11:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:11:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:11:44,011 INFO L87 Difference]: Start difference. First operand 28002 states and 39242 transitions. Second operand 9 states. [2019-09-08 11:11:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:58,317 INFO L93 Difference]: Finished difference Result 114156 states and 163921 transitions. [2019-09-08 11:11:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:11:58,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:11:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:58,416 INFO L225 Difference]: With dead ends: 114156 [2019-09-08 11:11:58,416 INFO L226 Difference]: Without dead ends: 96388 [2019-09-08 11:11:58,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:11:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96388 states. [2019-09-08 11:12:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96388 to 28002. [2019-09-08 11:12:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-09-08 11:12:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 39226 transitions. [2019-09-08 11:12:01,948 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 39226 transitions. Word has length 87 [2019-09-08 11:12:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:01,948 INFO L475 AbstractCegarLoop]: Abstraction has 28002 states and 39226 transitions. [2019-09-08 11:12:01,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:12:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 39226 transitions. [2019-09-08 11:12:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:12:01,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:01,963 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:12:01,963 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1529995204, now seen corresponding path program 1 times [2019-09-08 11:12:01,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:01,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:01,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:02,087 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:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:12:02,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:12:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:12:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:12:02,089 INFO L87 Difference]: Start difference. First operand 28002 states and 39226 transitions. Second operand 4 states. [2019-09-08 11:12:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:07,747 INFO L93 Difference]: Finished difference Result 45770 states and 65228 transitions. [2019-09-08 11:12:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:12:07,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 11:12:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:07,789 INFO L225 Difference]: With dead ends: 45770 [2019-09-08 11:12:07,790 INFO L226 Difference]: Without dead ends: 45768 [2019-09-08 11:12:07,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:12:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45768 states. [2019-09-08 11:12:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45768 to 28000. [2019-09-08 11:12:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28000 states. [2019-09-08 11:12:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28000 states to 28000 states and 39117 transitions. [2019-09-08 11:12:11,037 INFO L78 Accepts]: Start accepts. Automaton has 28000 states and 39117 transitions. Word has length 87 [2019-09-08 11:12:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:11,037 INFO L475 AbstractCegarLoop]: Abstraction has 28000 states and 39117 transitions. [2019-09-08 11:12:11,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:12:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28000 states and 39117 transitions. [2019-09-08 11:12:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:11,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:11,049 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:12:11,050 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 408736059, now seen corresponding path program 1 times [2019-09-08 11:12:11,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:11,177 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:11,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:11,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:12:11,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:12:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:12:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:11,179 INFO L87 Difference]: Start difference. First operand 28000 states and 39117 transitions. Second operand 7 states. [2019-09-08 11:12:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:26,296 INFO L93 Difference]: Finished difference Result 105428 states and 150561 transitions. [2019-09-08 11:12:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:12:26,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:12:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:26,393 INFO L225 Difference]: With dead ends: 105428 [2019-09-08 11:12:26,394 INFO L226 Difference]: Without dead ends: 93576 [2019-09-08 11:12:26,417 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:12:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93576 states. [2019-09-08 11:12:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93576 to 28120. [2019-09-08 11:12:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28120 states. [2019-09-08 11:12:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28120 states to 28120 states and 39277 transitions. [2019-09-08 11:12:30,071 INFO L78 Accepts]: Start accepts. Automaton has 28120 states and 39277 transitions. Word has length 88 [2019-09-08 11:12:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:30,072 INFO L475 AbstractCegarLoop]: Abstraction has 28120 states and 39277 transitions. [2019-09-08 11:12:30,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 28120 states and 39277 transitions. [2019-09-08 11:12:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:30,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:30,083 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:12:30,083 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash -713841947, now seen corresponding path program 1 times [2019-09-08 11:12:30,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:30,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:30,673 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:30,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:30,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:12:30,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:12:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:12:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:12:30,675 INFO L87 Difference]: Start difference. First operand 28120 states and 39277 transitions. Second operand 12 states. [2019-09-08 11:12:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:46,805 INFO L93 Difference]: Finished difference Result 117560 states and 169056 transitions. [2019-09-08 11:12:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:12:46,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-08 11:12:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:46,912 INFO L225 Difference]: With dead ends: 117560 [2019-09-08 11:12:46,912 INFO L226 Difference]: Without dead ends: 98880 [2019-09-08 11:12:46,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:12:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98880 states. [2019-09-08 11:12:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98880 to 27188. [2019-09-08 11:12:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27188 states. [2019-09-08 11:12:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27188 states to 27188 states and 38041 transitions. [2019-09-08 11:12:52,440 INFO L78 Accepts]: Start accepts. Automaton has 27188 states and 38041 transitions. Word has length 88 [2019-09-08 11:12:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:52,440 INFO L475 AbstractCegarLoop]: Abstraction has 27188 states and 38041 transitions. [2019-09-08 11:12:52,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:12:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27188 states and 38041 transitions. [2019-09-08 11:12:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:52,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:52,450 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:12:52,450 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1770702308, now seen corresponding path program 1 times [2019-09-08 11:12:52,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:52,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:52,737 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:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:12:52,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:12:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:12:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:12:52,741 INFO L87 Difference]: Start difference. First operand 27188 states and 38041 transitions. Second operand 10 states. [2019-09-08 11:13:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:15,008 INFO L93 Difference]: Finished difference Result 117237 states and 166635 transitions. [2019-09-08 11:13:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:13:15,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:13:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:15,132 INFO L225 Difference]: With dead ends: 117237 [2019-09-08 11:13:15,132 INFO L226 Difference]: Without dead ends: 111862 [2019-09-08 11:13:15,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:13:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111862 states. [2019-09-08 11:13:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111862 to 27192. [2019-09-08 11:13:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27192 states. [2019-09-08 11:13:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27192 states to 27192 states and 38044 transitions. [2019-09-08 11:13:19,605 INFO L78 Accepts]: Start accepts. Automaton has 27192 states and 38044 transitions. Word has length 88 [2019-09-08 11:13:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:19,605 INFO L475 AbstractCegarLoop]: Abstraction has 27192 states and 38044 transitions. [2019-09-08 11:13:19,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:13:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27192 states and 38044 transitions. [2019-09-08 11:13:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:19,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:19,616 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:13:19,616 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash -476536620, now seen corresponding path program 1 times [2019-09-08 11:13:19,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:19,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:19,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:19,732 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:13:19,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:19,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:19,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:19,734 INFO L87 Difference]: Start difference. First operand 27192 states and 38044 transitions. Second operand 7 states. [2019-09-08 11:13:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:42,069 INFO L93 Difference]: Finished difference Result 117098 states and 167623 transitions. [2019-09-08 11:13:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:13:42,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:13:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:42,195 INFO L225 Difference]: With dead ends: 117098 [2019-09-08 11:13:42,196 INFO L226 Difference]: Without dead ends: 105178 [2019-09-08 11:13:42,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:13:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105178 states. [2019-09-08 11:13:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105178 to 27252. [2019-09-08 11:13:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27252 states. [2019-09-08 11:13:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27252 states to 27252 states and 38124 transitions. [2019-09-08 11:13:46,852 INFO L78 Accepts]: Start accepts. Automaton has 27252 states and 38124 transitions. Word has length 88 [2019-09-08 11:13:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:46,852 INFO L475 AbstractCegarLoop]: Abstraction has 27252 states and 38124 transitions. [2019-09-08 11:13:46,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 27252 states and 38124 transitions. [2019-09-08 11:13:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:46,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:46,862 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:13:46,862 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1162866559, now seen corresponding path program 1 times [2019-09-08 11:13:46,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:47,057 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:13:47,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:47,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:13:47,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:13:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:13:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:13:47,059 INFO L87 Difference]: Start difference. First operand 27252 states and 38124 transitions. Second operand 9 states. [2019-09-08 11:14:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:07,731 INFO L93 Difference]: Finished difference Result 114153 states and 163847 transitions. [2019-09-08 11:14:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:14:07,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:14:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:07,833 INFO L225 Difference]: With dead ends: 114153 [2019-09-08 11:14:07,833 INFO L226 Difference]: Without dead ends: 96317 [2019-09-08 11:14:07,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:14:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96317 states. [2019-09-08 11:14:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96317 to 27218. [2019-09-08 11:14:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27218 states. [2019-09-08 11:14:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27218 states to 27218 states and 38072 transitions. [2019-09-08 11:14:12,672 INFO L78 Accepts]: Start accepts. Automaton has 27218 states and 38072 transitions. Word has length 88 [2019-09-08 11:14:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:12,672 INFO L475 AbstractCegarLoop]: Abstraction has 27218 states and 38072 transitions. [2019-09-08 11:14:12,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:14:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27218 states and 38072 transitions. [2019-09-08 11:14:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:12,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:12,683 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:14:12,683 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2079834142, now seen corresponding path program 1 times [2019-09-08 11:14:12,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:12,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:12,910 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:14:12,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:14:12,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:14:12,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:14:12,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:14:12,911 INFO L87 Difference]: Start difference. First operand 27218 states and 38072 transitions. Second operand 10 states. [2019-09-08 11:14:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:42,440 INFO L93 Difference]: Finished difference Result 129139 states and 183924 transitions. [2019-09-08 11:14:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:14:42,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:14:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:42,575 INFO L225 Difference]: With dead ends: 129139 [2019-09-08 11:14:42,575 INFO L226 Difference]: Without dead ends: 120082 [2019-09-08 11:14:42,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:14:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120082 states. [2019-09-08 11:14:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120082 to 27214. [2019-09-08 11:14:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27214 states. [2019-09-08 11:14:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27214 states to 27214 states and 38064 transitions. [2019-09-08 11:14:48,092 INFO L78 Accepts]: Start accepts. Automaton has 27214 states and 38064 transitions. Word has length 89 [2019-09-08 11:14:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:48,093 INFO L475 AbstractCegarLoop]: Abstraction has 27214 states and 38064 transitions. [2019-09-08 11:14:48,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:14:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27214 states and 38064 transitions. [2019-09-08 11:14:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:48,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:48,103 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:14:48,104 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 46798084, now seen corresponding path program 1 times [2019-09-08 11:14:48,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:48,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:48,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:48,783 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:14:48,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:14:48,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:14:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:14:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:14:48,784 INFO L87 Difference]: Start difference. First operand 27214 states and 38064 transitions. Second operand 15 states. [2019-09-08 11:14:49,569 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 11:14:49,813 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 11:15:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:38,646 INFO L93 Difference]: Finished difference Result 202845 states and 293428 transitions. [2019-09-08 11:15:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:15:38,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-08 11:15:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:38,856 INFO L225 Difference]: With dead ends: 202845 [2019-09-08 11:15:38,857 INFO L226 Difference]: Without dead ends: 185053 [2019-09-08 11:15:38,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:15:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185053 states. [2019-09-08 11:15:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185053 to 27190. [2019-09-08 11:15:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27190 states. [2019-09-08 11:15:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27190 states to 27190 states and 38016 transitions. [2019-09-08 11:15:45,234 INFO L78 Accepts]: Start accepts. Automaton has 27190 states and 38016 transitions. Word has length 89 [2019-09-08 11:15:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:45,235 INFO L475 AbstractCegarLoop]: Abstraction has 27190 states and 38016 transitions. [2019-09-08 11:15:45,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:15:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 27190 states and 38016 transitions. [2019-09-08 11:15:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:15:45,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:45,245 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:15:45,245 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 662760208, now seen corresponding path program 1 times [2019-09-08 11:15:45,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:45,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:45,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:45,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:45,362 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:15:45,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:45,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:45,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:45,363 INFO L87 Difference]: Start difference. First operand 27190 states and 38016 transitions. Second operand 7 states. [2019-09-08 11:16:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:10,860 INFO L93 Difference]: Finished difference Result 104678 states and 149532 transitions. [2019-09-08 11:16:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:16:10,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:16:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:10,968 INFO L225 Difference]: With dead ends: 104678 [2019-09-08 11:16:10,968 INFO L226 Difference]: Without dead ends: 92778 [2019-09-08 11:16:10,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:16:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92778 states. [2019-09-08 11:16:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92778 to 27446. [2019-09-08 11:16:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27446 states. [2019-09-08 11:16:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27446 states to 27446 states and 38362 transitions. [2019-09-08 11:16:17,105 INFO L78 Accepts]: Start accepts. Automaton has 27446 states and 38362 transitions. Word has length 89 [2019-09-08 11:16:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:17,106 INFO L475 AbstractCegarLoop]: Abstraction has 27446 states and 38362 transitions. [2019-09-08 11:16:17,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:16:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 27446 states and 38362 transitions. [2019-09-08 11:16:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:16:17,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:17,117 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:16:17,117 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1069989877, now seen corresponding path program 1 times [2019-09-08 11:16:17,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:17,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:17,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:17,545 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:16:17,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:17,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:16:17,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:16:17,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:16:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:16:17,547 INFO L87 Difference]: Start difference. First operand 27446 states and 38362 transitions. Second operand 13 states. [2019-09-08 11:16:18,095 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:16:18,291 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:16:18,817 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:16:19,198 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-08 11:17:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:04,527 INFO L93 Difference]: Finished difference Result 175029 states and 252171 transitions. [2019-09-08 11:17:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:17:04,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2019-09-08 11:17:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:04,715 INFO L225 Difference]: With dead ends: 175029 [2019-09-08 11:17:04,716 INFO L226 Difference]: Without dead ends: 156351 [2019-09-08 11:17:04,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:17:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156351 states. [2019-09-08 11:17:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156351 to 26524. [2019-09-08 11:17:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26524 states. [2019-09-08 11:17:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26524 states to 26524 states and 37134 transitions. [2019-09-08 11:17:12,441 INFO L78 Accepts]: Start accepts. Automaton has 26524 states and 37134 transitions. Word has length 89 [2019-09-08 11:17:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:12,442 INFO L475 AbstractCegarLoop]: Abstraction has 26524 states and 37134 transitions. [2019-09-08 11:17:12,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:17:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26524 states and 37134 transitions. [2019-09-08 11:17:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:17:12,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:12,455 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:17:12,455 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 834761733, now seen corresponding path program 1 times [2019-09-08 11:17:12,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:12,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:12,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:12,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:12,577 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:17:12,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:12,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:17:12,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:17:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:17:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:17:12,579 INFO L87 Difference]: Start difference. First operand 26524 states and 37134 transitions. Second operand 7 states. [2019-09-08 11:17:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:48,734 INFO L93 Difference]: Finished difference Result 118190 states and 169210 transitions. [2019-09-08 11:17:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:17:48,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:17:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:48,861 INFO L225 Difference]: With dead ends: 118190 [2019-09-08 11:17:48,861 INFO L226 Difference]: Without dead ends: 107294 [2019-09-08 11:17:48,887 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:17:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107294 states. [2019-09-08 11:17:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107294 to 26599. [2019-09-08 11:17:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26599 states. [2019-09-08 11:17:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26599 states to 26599 states and 37234 transitions. [2019-09-08 11:17:56,802 INFO L78 Accepts]: Start accepts. Automaton has 26599 states and 37234 transitions. Word has length 90 [2019-09-08 11:17:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:56,802 INFO L475 AbstractCegarLoop]: Abstraction has 26599 states and 37234 transitions. [2019-09-08 11:17:56,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:17:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 26599 states and 37234 transitions. [2019-09-08 11:17:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:17:56,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:56,813 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:17:56,814 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1914506380, now seen corresponding path program 1 times [2019-09-08 11:17:56,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:56,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:56,941 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:17:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:17:56,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:17:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:17:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:17:56,944 INFO L87 Difference]: Start difference. First operand 26599 states and 37234 transitions. Second operand 7 states. [2019-09-08 11:18:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:35,171 INFO L93 Difference]: Finished difference Result 117012 states and 167469 transitions. [2019-09-08 11:18:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:18:35,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:18:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:35,282 INFO L225 Difference]: With dead ends: 117012 [2019-09-08 11:18:35,282 INFO L226 Difference]: Without dead ends: 104928 [2019-09-08 11:18:35,307 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:18:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104928 states. [2019-09-08 11:18:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104928 to 26747. [2019-09-08 11:18:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26747 states. [2019-09-08 11:18:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26747 states to 26747 states and 37432 transitions. [2019-09-08 11:18:43,171 INFO L78 Accepts]: Start accepts. Automaton has 26747 states and 37432 transitions. Word has length 90 [2019-09-08 11:18:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:43,171 INFO L475 AbstractCegarLoop]: Abstraction has 26747 states and 37432 transitions. [2019-09-08 11:18:43,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:18:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 26747 states and 37432 transitions. [2019-09-08 11:18:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:18:43,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:43,184 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:18:43,184 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -635596779, now seen corresponding path program 1 times [2019-09-08 11:18:43,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:43,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:43,409 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:18:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:18:43,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:18:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:18:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:18:43,416 INFO L87 Difference]: Start difference. First operand 26747 states and 37432 transitions. Second operand 10 states. [2019-09-08 11:19:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:19,992 INFO L93 Difference]: Finished difference Result 120840 states and 173417 transitions. [2019-09-08 11:19:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:19:19,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 11:19:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:20,110 INFO L225 Difference]: With dead ends: 120840 [2019-09-08 11:19:20,110 INFO L226 Difference]: Without dead ends: 101960 [2019-09-08 11:19:20,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:19:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101960 states. [2019-09-08 11:19:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101960 to 26176. [2019-09-08 11:19:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26176 states. [2019-09-08 11:19:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26176 states to 26176 states and 36652 transitions. [2019-09-08 11:19:28,228 INFO L78 Accepts]: Start accepts. Automaton has 26176 states and 36652 transitions. Word has length 90 [2019-09-08 11:19:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:28,229 INFO L475 AbstractCegarLoop]: Abstraction has 26176 states and 36652 transitions. [2019-09-08 11:19:28,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:19:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26176 states and 36652 transitions. [2019-09-08 11:19:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:19:28,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:28,240 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:19:28,241 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash 543181299, now seen corresponding path program 1 times [2019-09-08 11:19:28,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:28,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:28,409 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:19:28,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:19:28,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:19:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:19:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:19:28,411 INFO L87 Difference]: Start difference. First operand 26176 states and 36652 transitions. Second operand 9 states. [2019-09-08 11:20:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:06,699 INFO L93 Difference]: Finished difference Result 112718 states and 163014 transitions. [2019-09-08 11:20:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:20:06,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-08 11:20:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:06,799 INFO L225 Difference]: With dead ends: 112718 [2019-09-08 11:20:06,799 INFO L226 Difference]: Without dead ends: 94784 [2019-09-08 11:20:06,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:20:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94784 states. [2019-09-08 11:20:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94784 to 26093. [2019-09-08 11:20:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26093 states. [2019-09-08 11:20:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26093 states to 26093 states and 36531 transitions. [2019-09-08 11:20:15,331 INFO L78 Accepts]: Start accepts. Automaton has 26093 states and 36531 transitions. Word has length 90 [2019-09-08 11:20:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:15,331 INFO L475 AbstractCegarLoop]: Abstraction has 26093 states and 36531 transitions. [2019-09-08 11:20:15,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:20:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26093 states and 36531 transitions. [2019-09-08 11:20:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:20:15,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:15,342 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, 1] [2019-09-08 11:20:15,342 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1769643837, now seen corresponding path program 1 times [2019-09-08 11:20:15,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:15,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:16,393 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:20:16,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:16,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 11:20:16,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:20:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:20:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:20:16,394 INFO L87 Difference]: Start difference. First operand 26093 states and 36531 transitions. Second operand 18 states. [2019-09-08 11:20:17,256 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 11:20:17,597 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 11:20:18,126 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-08 11:20:19,055 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-08 11:20:20,078 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 11:20:20,737 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 11:20:21,012 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 11:20:21,297 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 11:20:22,467 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 11:20:23,460 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 11:20:39,214 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 11:21:14,090 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 11:21:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:25,686 INFO L93 Difference]: Finished difference Result 159272 states and 229582 transitions. [2019-09-08 11:21:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 11:21:25,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-08 11:21:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:25,862 INFO L225 Difference]: With dead ends: 159272 [2019-09-08 11:21:25,863 INFO L226 Difference]: Without dead ends: 152336 [2019-09-08 11:21:25,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=386, Invalid=1336, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 11:21:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152336 states. [2019-09-08 11:21:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152336 to 26143. [2019-09-08 11:21:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26143 states. [2019-09-08 11:21:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26143 states to 26143 states and 36602 transitions. [2019-09-08 11:21:35,084 INFO L78 Accepts]: Start accepts. Automaton has 26143 states and 36602 transitions. Word has length 91 [2019-09-08 11:21:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:35,085 INFO L475 AbstractCegarLoop]: Abstraction has 26143 states and 36602 transitions. [2019-09-08 11:21:35,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 11:21:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 26143 states and 36602 transitions. [2019-09-08 11:21:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:21:35,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:35,096 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, 1] [2019-09-08 11:21:35,096 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:35,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1250919733, now seen corresponding path program 1 times [2019-09-08 11:21:35,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:35,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:35,564 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:21:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:35,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:21:35,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:21:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:21:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:21:35,566 INFO L87 Difference]: Start difference. First operand 26143 states and 36602 transitions. Second operand 13 states. [2019-09-08 11:21:36,020 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:21:36,231 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:22:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:33,874 INFO L93 Difference]: Finished difference Result 154691 states and 223340 transitions. [2019-09-08 11:22:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:22:33,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-08 11:22:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:34,043 INFO L225 Difference]: With dead ends: 154691 [2019-09-08 11:22:34,043 INFO L226 Difference]: Without dead ends: 136667 [2019-09-08 11:22:34,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:22:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136667 states. [2019-09-08 11:22:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136667 to 25887. [2019-09-08 11:22:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25887 states. [2019-09-08 11:22:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25887 states to 25887 states and 36237 transitions. [2019-09-08 11:22:43,802 INFO L78 Accepts]: Start accepts. Automaton has 25887 states and 36237 transitions. Word has length 91 [2019-09-08 11:22:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:43,802 INFO L475 AbstractCegarLoop]: Abstraction has 25887 states and 36237 transitions. [2019-09-08 11:22:43,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:22:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 25887 states and 36237 transitions. [2019-09-08 11:22:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 11:22:43,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:43,814 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, 1, 1] [2019-09-08 11:22:43,814 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1260540226, now seen corresponding path program 1 times [2019-09-08 11:22:43,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:43,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:43,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:43,967 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:22:43,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:43,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:22:43,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:22:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:22:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:22:43,968 INFO L87 Difference]: Start difference. First operand 25887 states and 36237 transitions. Second operand 9 states. [2019-09-08 11:23:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:27,554 INFO L93 Difference]: Finished difference Result 111372 states and 160086 transitions. [2019-09-08 11:23:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:23:27,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 11:23:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:27,656 INFO L225 Difference]: With dead ends: 111372 [2019-09-08 11:23:27,657 INFO L226 Difference]: Without dead ends: 93568 [2019-09-08 11:23:27,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:23:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93568 states.