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.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:48:55,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:48:55,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:48:55,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:48:55,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:48:55,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:48:55,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:48:55,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:48:55,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:48:55,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:48:55,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:48:55,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:48:55,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:48:55,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:48:55,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:48:55,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:48:55,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:48:55,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:48:55,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:48:55,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:48:55,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:48:55,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:48:55,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:48:55,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:48:55,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:48:55,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:48:55,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:48:55,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:48:55,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:48:55,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:48:55,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:48:55,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:48:55,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:48:55,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:48:55,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:48:55,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:48:55,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:48:55,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:48:55,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:48:55,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:48:55,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:48:55,297 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:48:55,323 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:48:55,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:48:55,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:48:55,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:48:55,326 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:48:55,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:48:55,326 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:48:55,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:48:55,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:48:55,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:48:55,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:48:55,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:48:55,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:48:55,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:48:55,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:48:55,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:48:55,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:48:55,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:48:55,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:48:55,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:48:55,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:48:55,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:48:55,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:48:55,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:48:55,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:48:55,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:48:55,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:48:55,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:48:55,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:48:55,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:48:55,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:48:55,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:48:55,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:48:55,407 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:48:55,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:48:55,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c70a3b3f/d320e20a864747f6b94365e1af3fc477/FLAG14b572e87 [2019-09-08 11:48:56,047 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:48:56,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:48:56,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c70a3b3f/d320e20a864747f6b94365e1af3fc477/FLAG14b572e87 [2019-09-08 11:48:56,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c70a3b3f/d320e20a864747f6b94365e1af3fc477 [2019-09-08 11:48:56,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:48:56,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:48:56,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:48:56,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:48:56,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:48:56,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:48:56" (1/1) ... [2019-09-08 11:48:56,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545ef91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:56, skipping insertion in model container [2019-09-08 11:48:56,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:48:56" (1/1) ... [2019-09-08 11:48:56,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:48:56,426 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:48:57,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:48:57,232 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:48:57,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:48:57,543 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:48:57,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57 WrapperNode [2019-09-08 11:48:57,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:48:57,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:48:57,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:48:57,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:48:57,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (1/1) ... [2019-09-08 11:48:57,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:48:57,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:48:57,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:48:57,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:48:57,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (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:48:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:48:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:48:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:48:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:48:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:48:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:48:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:48:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:48:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:48:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:48:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:48:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:48:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:48:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:48:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:48:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:48:59,920 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:48:59,921 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:48:59,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:48:59 BoogieIcfgContainer [2019-09-08 11:48:59,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:48:59,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:48:59,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:48:59,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:48:59,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:48:56" (1/3) ... [2019-09-08 11:48:59,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c021b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:48:59, skipping insertion in model container [2019-09-08 11:48:59,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:48:57" (2/3) ... [2019-09-08 11:48:59,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c021b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:48:59, skipping insertion in model container [2019-09-08 11:48:59,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:48:59" (3/3) ... [2019-09-08 11:48:59,935 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:48:59,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:48:59,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:48:59,991 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:49:00,036 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:49:00,037 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:49:00,037 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:49:00,037 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:49:00,037 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:49:00,037 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:49:00,037 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:49:00,038 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:49:00,038 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:49:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states. [2019-09-08 11:49:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:49:00,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:00,109 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] [2019-09-08 11:49:00,112 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -221233155, now seen corresponding path program 1 times [2019-09-08 11:49:00,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:00,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:00,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:00,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:00,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:00,586 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:49:00,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:00,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:49:00,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:49:00,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:49:00,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:00,611 INFO L87 Difference]: Start difference. First operand 542 states. Second operand 5 states. [2019-09-08 11:49:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:01,534 INFO L93 Difference]: Finished difference Result 902 states and 1545 transitions. [2019-09-08 11:49:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:49:01,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:49:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:01,555 INFO L225 Difference]: With dead ends: 902 [2019-09-08 11:49:01,555 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 11:49:01,562 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:49:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 11:49:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 549. [2019-09-08 11:49:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-08 11:49:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 724 transitions. [2019-09-08 11:49:01,671 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 724 transitions. Word has length 63 [2019-09-08 11:49:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:01,672 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 724 transitions. [2019-09-08 11:49:01,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:49:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 724 transitions. [2019-09-08 11:49:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:49:01,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:01,679 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] [2019-09-08 11:49:01,680 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -490750818, now seen corresponding path program 1 times [2019-09-08 11:49:01,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:01,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:01,944 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:49:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:49:01,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:49:01,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:49:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:01,947 INFO L87 Difference]: Start difference. First operand 549 states and 724 transitions. Second operand 5 states. [2019-09-08 11:49:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:02,244 INFO L93 Difference]: Finished difference Result 705 states and 935 transitions. [2019-09-08 11:49:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:49:02,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:49:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:02,248 INFO L225 Difference]: With dead ends: 705 [2019-09-08 11:49:02,248 INFO L226 Difference]: Without dead ends: 405 [2019-09-08 11:49:02,253 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:49:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-08 11:49:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-09-08 11:49:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-08 11:49:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 535 transitions. [2019-09-08 11:49:02,302 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 535 transitions. Word has length 63 [2019-09-08 11:49:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:02,302 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 535 transitions. [2019-09-08 11:49:02,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:49:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 535 transitions. [2019-09-08 11:49:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:49:02,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:02,306 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] [2019-09-08 11:49:02,307 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:02,308 INFO L82 PathProgramCache]: Analyzing trace with hash 556502945, now seen corresponding path program 1 times [2019-09-08 11:49:02,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:02,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:02,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:02,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:02,539 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:49:02,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:02,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:49:02,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:49:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:49:02,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:49:02,541 INFO L87 Difference]: Start difference. First operand 405 states and 535 transitions. Second operand 6 states. [2019-09-08 11:49:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:02,873 INFO L93 Difference]: Finished difference Result 764 states and 1022 transitions. [2019-09-08 11:49:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:49:02,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-08 11:49:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:02,879 INFO L225 Difference]: With dead ends: 764 [2019-09-08 11:49:02,879 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 11:49:02,880 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:49:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 11:49:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 512. [2019-09-08 11:49:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 11:49:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 696 transitions. [2019-09-08 11:49:02,916 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 696 transitions. Word has length 63 [2019-09-08 11:49:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:02,918 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 696 transitions. [2019-09-08 11:49:02,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:49:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 696 transitions. [2019-09-08 11:49:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:49:02,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:02,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:02,921 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1040476392, now seen corresponding path program 1 times [2019-09-08 11:49:02,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:02,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:03,053 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:49:03,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:03,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:49:03,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:49:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:49:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:03,055 INFO L87 Difference]: Start difference. First operand 512 states and 696 transitions. Second operand 5 states. [2019-09-08 11:49:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:03,267 INFO L93 Difference]: Finished difference Result 810 states and 1117 transitions. [2019-09-08 11:49:03,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:49:03,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:49:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:03,271 INFO L225 Difference]: With dead ends: 810 [2019-09-08 11:49:03,271 INFO L226 Difference]: Without dead ends: 464 [2019-09-08 11:49:03,272 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:49:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-08 11:49:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-08 11:49:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 631 transitions. [2019-09-08 11:49:03,296 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 631 transitions. Word has length 64 [2019-09-08 11:49:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:03,297 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 631 transitions. [2019-09-08 11:49:03,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:49:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 631 transitions. [2019-09-08 11:49:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:49:03,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:03,299 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] [2019-09-08 11:49:03,299 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash 811942748, now seen corresponding path program 1 times [2019-09-08 11:49:03,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:03,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:03,450 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:49:03,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:03,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:03,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:03,452 INFO L87 Difference]: Start difference. First operand 464 states and 631 transitions. Second operand 9 states. [2019-09-08 11:49:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:04,665 INFO L93 Difference]: Finished difference Result 1444 states and 2070 transitions. [2019-09-08 11:49:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:49:04,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-08 11:49:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:04,673 INFO L225 Difference]: With dead ends: 1444 [2019-09-08 11:49:04,673 INFO L226 Difference]: Without dead ends: 1198 [2019-09-08 11:49:04,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:49:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-09-08 11:49:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 464. [2019-09-08 11:49:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 630 transitions. [2019-09-08 11:49:04,722 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 630 transitions. Word has length 65 [2019-09-08 11:49:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:04,722 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 630 transitions. [2019-09-08 11:49:04,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 630 transitions. [2019-09-08 11:49:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:49:04,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:04,724 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] [2019-09-08 11:49:04,724 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1192590481, now seen corresponding path program 1 times [2019-09-08 11:49:04,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:04,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:04,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:04,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:04,882 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:49:04,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:04,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:04,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:04,884 INFO L87 Difference]: Start difference. First operand 464 states and 630 transitions. Second operand 9 states. [2019-09-08 11:49:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:05,775 INFO L93 Difference]: Finished difference Result 1204 states and 1706 transitions. [2019-09-08 11:49:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:05,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-08 11:49:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:05,782 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 11:49:05,783 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:49:05,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:49:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-08 11:49:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 629 transitions. [2019-09-08 11:49:05,830 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 629 transitions. Word has length 65 [2019-09-08 11:49:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:05,830 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 629 transitions. [2019-09-08 11:49:05,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 629 transitions. [2019-09-08 11:49:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:49:05,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:05,832 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] [2019-09-08 11:49:05,832 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1959558393, now seen corresponding path program 1 times [2019-09-08 11:49:05,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:05,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:05,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:05,981 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:49:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:05,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:49:05,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:49:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:49:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:49:05,983 INFO L87 Difference]: Start difference. First operand 464 states and 629 transitions. Second operand 8 states. [2019-09-08 11:49:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:06,433 INFO L93 Difference]: Finished difference Result 902 states and 1240 transitions. [2019-09-08 11:49:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:49:06,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-09-08 11:49:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:06,437 INFO L225 Difference]: With dead ends: 902 [2019-09-08 11:49:06,437 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 11:49:06,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:49:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 11:49:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-09-08 11:49:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 628 transitions. [2019-09-08 11:49:06,475 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 628 transitions. Word has length 65 [2019-09-08 11:49:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:06,475 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 628 transitions. [2019-09-08 11:49:06,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:49:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 628 transitions. [2019-09-08 11:49:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:06,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:06,477 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] [2019-09-08 11:49:06,478 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 297751041, now seen corresponding path program 1 times [2019-09-08 11:49:06,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:06,628 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:49:06,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:06,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:06,630 INFO L87 Difference]: Start difference. First operand 464 states and 628 transitions. Second operand 9 states. [2019-09-08 11:49:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:07,616 INFO L93 Difference]: Finished difference Result 1412 states and 2021 transitions. [2019-09-08 11:49:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:07,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:07,623 INFO L225 Difference]: With dead ends: 1412 [2019-09-08 11:49:07,623 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:49:07,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:49:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-08 11:49:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 627 transitions. [2019-09-08 11:49:07,668 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 627 transitions. Word has length 67 [2019-09-08 11:49:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:07,669 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 627 transitions. [2019-09-08 11:49:07,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 627 transitions. [2019-09-08 11:49:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:07,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:07,670 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] [2019-09-08 11:49:07,671 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -101064039, now seen corresponding path program 1 times [2019-09-08 11:49:07,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:07,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:07,828 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:49:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:07,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:07,829 INFO L87 Difference]: Start difference. First operand 464 states and 627 transitions. Second operand 9 states. [2019-09-08 11:49:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:08,852 INFO L93 Difference]: Finished difference Result 1448 states and 2074 transitions. [2019-09-08 11:49:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:08,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:08,859 INFO L225 Difference]: With dead ends: 1448 [2019-09-08 11:49:08,859 INFO L226 Difference]: Without dead ends: 1223 [2019-09-08 11:49:08,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-08 11:49:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-08 11:49:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 626 transitions. [2019-09-08 11:49:08,909 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 626 transitions. Word has length 67 [2019-09-08 11:49:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:08,909 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 626 transitions. [2019-09-08 11:49:08,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 626 transitions. [2019-09-08 11:49:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:08,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:08,911 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] [2019-09-08 11:49:08,911 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash 217206227, now seen corresponding path program 1 times [2019-09-08 11:49:08,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:08,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:08,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:08,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:09,051 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:49:09,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:09,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:09,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:09,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:09,054 INFO L87 Difference]: Start difference. First operand 464 states and 626 transitions. Second operand 9 states. [2019-09-08 11:49:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:10,116 INFO L93 Difference]: Finished difference Result 1409 states and 2016 transitions. [2019-09-08 11:49:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:10,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:10,127 INFO L225 Difference]: With dead ends: 1409 [2019-09-08 11:49:10,127 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:49:10,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:49:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-08 11:49:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 625 transitions. [2019-09-08 11:49:10,176 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 625 transitions. Word has length 67 [2019-09-08 11:49:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:10,177 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 625 transitions. [2019-09-08 11:49:10,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 625 transitions. [2019-09-08 11:49:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:10,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:10,178 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] [2019-09-08 11:49:10,178 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1537942501, now seen corresponding path program 1 times [2019-09-08 11:49:10,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:10,311 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:49:10,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:10,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:10,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:10,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:10,313 INFO L87 Difference]: Start difference. First operand 464 states and 625 transitions. Second operand 9 states. [2019-09-08 11:49:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:11,288 INFO L93 Difference]: Finished difference Result 1443 states and 2065 transitions. [2019-09-08 11:49:11,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:11,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:11,296 INFO L225 Difference]: With dead ends: 1443 [2019-09-08 11:49:11,296 INFO L226 Difference]: Without dead ends: 1223 [2019-09-08 11:49:11,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-08 11:49:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-08 11:49:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 624 transitions. [2019-09-08 11:49:11,346 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 624 transitions. Word has length 67 [2019-09-08 11:49:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:11,347 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 624 transitions. [2019-09-08 11:49:11,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 624 transitions. [2019-09-08 11:49:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:11,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:11,348 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] [2019-09-08 11:49:11,349 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -149286562, now seen corresponding path program 1 times [2019-09-08 11:49:11,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:11,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:11,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:11,522 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:49:11,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:11,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:11,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:11,524 INFO L87 Difference]: Start difference. First operand 464 states and 624 transitions. Second operand 9 states. [2019-09-08 11:49:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:12,472 INFO L93 Difference]: Finished difference Result 1291 states and 1849 transitions. [2019-09-08 11:49:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:49:12,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:12,476 INFO L225 Difference]: With dead ends: 1291 [2019-09-08 11:49:12,476 INFO L226 Difference]: Without dead ends: 1005 [2019-09-08 11:49:12,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:49:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-08 11:49:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 464. [2019-09-08 11:49:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 622 transitions. [2019-09-08 11:49:12,530 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 622 transitions. Word has length 67 [2019-09-08 11:49:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:12,530 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 622 transitions. [2019-09-08 11:49:12,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 622 transitions. [2019-09-08 11:49:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:12,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:12,531 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] [2019-09-08 11:49:12,532 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 415538350, now seen corresponding path program 1 times [2019-09-08 11:49:12,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:12,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:12,675 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:49:12,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:12,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:12,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:12,676 INFO L87 Difference]: Start difference. First operand 464 states and 622 transitions. Second operand 9 states. [2019-09-08 11:49:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:13,739 INFO L93 Difference]: Finished difference Result 1204 states and 1697 transitions. [2019-09-08 11:49:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:13,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:13,745 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 11:49:13,745 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:49:13,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:49:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-08 11:49:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 620 transitions. [2019-09-08 11:49:13,799 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 620 transitions. Word has length 67 [2019-09-08 11:49:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:13,799 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 620 transitions. [2019-09-08 11:49:13,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 620 transitions. [2019-09-08 11:49:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:49:13,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:13,800 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] [2019-09-08 11:49:13,801 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1403250118, now seen corresponding path program 1 times [2019-09-08 11:49:13,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:13,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:13,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:13,916 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:49:13,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:13,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:13,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:13,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:13,920 INFO L87 Difference]: Start difference. First operand 464 states and 620 transitions. Second operand 9 states. [2019-09-08 11:49:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:15,136 INFO L93 Difference]: Finished difference Result 1240 states and 1748 transitions. [2019-09-08 11:49:15,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:15,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:49:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:15,141 INFO L225 Difference]: With dead ends: 1240 [2019-09-08 11:49:15,141 INFO L226 Difference]: Without dead ends: 1223 [2019-09-08 11:49:15,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-08 11:49:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-08 11:49:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:49:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 618 transitions. [2019-09-08 11:49:15,197 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 618 transitions. Word has length 67 [2019-09-08 11:49:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:15,197 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 618 transitions. [2019-09-08 11:49:15,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 618 transitions. [2019-09-08 11:49:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:49:15,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:15,199 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] [2019-09-08 11:49:15,199 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash 819188212, now seen corresponding path program 1 times [2019-09-08 11:49:15,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:16,220 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:49:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:49:16,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:49:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:49:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:49:16,222 INFO L87 Difference]: Start difference. First operand 464 states and 618 transitions. Second operand 19 states. [2019-09-08 11:49:16,963 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:49:17,096 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:49:17,226 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:49:17,390 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-08 11:49:17,530 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:49:17,688 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-08 11:49:17,836 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:49:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:19,831 INFO L93 Difference]: Finished difference Result 1308 states and 1853 transitions. [2019-09-08 11:49:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:49:19,832 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-09-08 11:49:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:19,836 INFO L225 Difference]: With dead ends: 1308 [2019-09-08 11:49:19,836 INFO L226 Difference]: Without dead ends: 1067 [2019-09-08 11:49:19,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:49:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-08 11:49:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 470. [2019-09-08 11:49:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 11:49:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 624 transitions. [2019-09-08 11:49:19,903 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 624 transitions. Word has length 69 [2019-09-08 11:49:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:19,903 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 624 transitions. [2019-09-08 11:49:19,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:49:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 624 transitions. [2019-09-08 11:49:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:49:19,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:19,905 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] [2019-09-08 11:49:19,905 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2009849792, now seen corresponding path program 1 times [2019-09-08 11:49:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:19,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:20,644 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:49:20,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:20,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:49:20,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:49:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:49:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:49:20,646 INFO L87 Difference]: Start difference. First operand 470 states and 624 transitions. Second operand 17 states. [2019-09-08 11:49:21,173 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 11:49:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:22,371 INFO L93 Difference]: Finished difference Result 1127 states and 1608 transitions. [2019-09-08 11:49:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:49:22,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-08 11:49:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:22,375 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 11:49:22,375 INFO L226 Difference]: Without dead ends: 896 [2019-09-08 11:49:22,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:49:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-09-08 11:49:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 460. [2019-09-08 11:49:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 11:49:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 610 transitions. [2019-09-08 11:49:22,439 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 610 transitions. Word has length 69 [2019-09-08 11:49:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:22,440 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 610 transitions. [2019-09-08 11:49:22,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:49:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 610 transitions. [2019-09-08 11:49:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:49:22,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:22,441 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] [2019-09-08 11:49:22,441 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -628951207, now seen corresponding path program 1 times [2019-09-08 11:49:22,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:23,700 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:49:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:23,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:49:23,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:49:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:49:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:49:23,701 INFO L87 Difference]: Start difference. First operand 460 states and 610 transitions. Second operand 21 states. [2019-09-08 11:49:23,828 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 11:49:24,605 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 11:49:24,805 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 11:49:25,075 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 11:49:25,260 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:49:25,442 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:49:25,633 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:49:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:27,134 INFO L93 Difference]: Finished difference Result 1134 states and 1580 transitions. [2019-09-08 11:49:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:49:27,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-08 11:49:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:27,138 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 11:49:27,138 INFO L226 Difference]: Without dead ends: 922 [2019-09-08 11:49:27,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:49:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-09-08 11:49:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 470. [2019-09-08 11:49:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 11:49:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 625 transitions. [2019-09-08 11:49:27,214 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 625 transitions. Word has length 69 [2019-09-08 11:49:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:27,214 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 625 transitions. [2019-09-08 11:49:27,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:49:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 625 transitions. [2019-09-08 11:49:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:49:27,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:27,216 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] [2019-09-08 11:49:27,216 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2003011199, now seen corresponding path program 1 times [2019-09-08 11:49:27,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:27,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:27,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:27,960 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:49:27,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:49:27,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:49:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:49:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:49:27,962 INFO L87 Difference]: Start difference. First operand 470 states and 625 transitions. Second operand 17 states. [2019-09-08 11:49:28,499 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 11:49:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:29,289 INFO L93 Difference]: Finished difference Result 822 states and 1142 transitions. [2019-09-08 11:49:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:49:29,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-08 11:49:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:29,292 INFO L225 Difference]: With dead ends: 822 [2019-09-08 11:49:29,292 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 11:49:29,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:49:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 11:49:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 450. [2019-09-08 11:49:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 11:49:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 598 transitions. [2019-09-08 11:49:29,362 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 598 transitions. Word has length 69 [2019-09-08 11:49:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:29,363 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 598 transitions. [2019-09-08 11:49:29,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:49:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 598 transitions. [2019-09-08 11:49:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:29,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:29,364 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] [2019-09-08 11:49:29,364 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1595609728, now seen corresponding path program 1 times [2019-09-08 11:49:29,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:29,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:29,725 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:49:29,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:29,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:49:29,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:49:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:49:29,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:49:29,728 INFO L87 Difference]: Start difference. First operand 450 states and 598 transitions. Second operand 11 states. [2019-09-08 11:49:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:30,396 INFO L93 Difference]: Finished difference Result 1150 states and 1630 transitions. [2019-09-08 11:49:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:49:30,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:49:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:30,400 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 11:49:30,401 INFO L226 Difference]: Without dead ends: 938 [2019-09-08 11:49:30,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:49:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-08 11:49:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 446. [2019-09-08 11:49:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-08 11:49:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 593 transitions. [2019-09-08 11:49:30,480 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 593 transitions. Word has length 70 [2019-09-08 11:49:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:30,481 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 593 transitions. [2019-09-08 11:49:30,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:49:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 593 transitions. [2019-09-08 11:49:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:30,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:30,482 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] [2019-09-08 11:49:30,482 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -110122555, now seen corresponding path program 1 times [2019-09-08 11:49:30,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:30,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:30,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:30,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:30,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:30,812 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:49:30,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:30,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:49:30,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:49:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:49:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:49:30,814 INFO L87 Difference]: Start difference. First operand 446 states and 593 transitions. Second operand 11 states. [2019-09-08 11:49:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:31,755 INFO L93 Difference]: Finished difference Result 1136 states and 1615 transitions. [2019-09-08 11:49:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:49:31,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:49:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:31,760 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 11:49:31,760 INFO L226 Difference]: Without dead ends: 927 [2019-09-08 11:49:31,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:49:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-08 11:49:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 445. [2019-09-08 11:49:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-08 11:49:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 591 transitions. [2019-09-08 11:49:31,892 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 591 transitions. Word has length 70 [2019-09-08 11:49:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 591 transitions. [2019-09-08 11:49:31,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:49:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 591 transitions. [2019-09-08 11:49:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:31,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:31,893 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] [2019-09-08 11:49:31,894 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -154027530, now seen corresponding path program 1 times [2019-09-08 11:49:31,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:31,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:31,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:31,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:32,316 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:49:32,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:32,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:49:32,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:49:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:49:32,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:49:32,317 INFO L87 Difference]: Start difference. First operand 445 states and 591 transitions. Second operand 13 states. [2019-09-08 11:49:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:33,626 INFO L93 Difference]: Finished difference Result 1361 states and 1951 transitions. [2019-09-08 11:49:33,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:49:33,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-09-08 11:49:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:33,631 INFO L225 Difference]: With dead ends: 1361 [2019-09-08 11:49:33,631 INFO L226 Difference]: Without dead ends: 1345 [2019-09-08 11:49:33,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:49:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-09-08 11:49:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 429. [2019-09-08 11:49:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 11:49:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 574 transitions. [2019-09-08 11:49:33,697 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 574 transitions. Word has length 70 [2019-09-08 11:49:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:33,697 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 574 transitions. [2019-09-08 11:49:33,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:49:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 574 transitions. [2019-09-08 11:49:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:33,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:33,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] [2019-09-08 11:49:33,699 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash 918653497, now seen corresponding path program 1 times [2019-09-08 11:49:33,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:33,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:33,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:34,184 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:49:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:49:34,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:49:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:49:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:49:34,186 INFO L87 Difference]: Start difference. First operand 429 states and 574 transitions. Second operand 12 states. [2019-09-08 11:49:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:35,190 INFO L93 Difference]: Finished difference Result 1149 states and 1633 transitions. [2019-09-08 11:49:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:49:35,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-08 11:49:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:35,196 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 11:49:35,196 INFO L226 Difference]: Without dead ends: 926 [2019-09-08 11:49:35,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:49:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-08 11:49:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 413. [2019-09-08 11:49:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-08 11:49:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2019-09-08 11:49:35,300 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 70 [2019-09-08 11:49:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:35,301 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2019-09-08 11:49:35,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:49:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2019-09-08 11:49:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:35,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:35,302 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] [2019-09-08 11:49:35,302 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2033083250, now seen corresponding path program 1 times [2019-09-08 11:49:35,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:35,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:35,644 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:49:35,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:35,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:49:35,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:49:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:49:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:49:35,645 INFO L87 Difference]: Start difference. First operand 413 states and 554 transitions. Second operand 12 states. [2019-09-08 11:49:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:36,783 INFO L93 Difference]: Finished difference Result 1404 states and 2000 transitions. [2019-09-08 11:49:36,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:49:36,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-08 11:49:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:36,788 INFO L225 Difference]: With dead ends: 1404 [2019-09-08 11:49:36,788 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 11:49:36,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:49:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 11:49:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 381. [2019-09-08 11:49:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-08 11:49:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 509 transitions. [2019-09-08 11:49:36,853 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 509 transitions. Word has length 70 [2019-09-08 11:49:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:36,854 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 509 transitions. [2019-09-08 11:49:36,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:49:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 509 transitions. [2019-09-08 11:49:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:36,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:36,854 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] [2019-09-08 11:49:36,855 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash -33038995, now seen corresponding path program 1 times [2019-09-08 11:49:36,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:36,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:36,973 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:49:36,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:36,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:36,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:36,974 INFO L87 Difference]: Start difference. First operand 381 states and 509 transitions. Second operand 9 states. [2019-09-08 11:49:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:37,697 INFO L93 Difference]: Finished difference Result 922 states and 1283 transitions. [2019-09-08 11:49:37,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:49:37,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:49:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:37,701 INFO L225 Difference]: With dead ends: 922 [2019-09-08 11:49:37,701 INFO L226 Difference]: Without dead ends: 670 [2019-09-08 11:49:37,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:49:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-08 11:49:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 381. [2019-09-08 11:49:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-08 11:49:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 507 transitions. [2019-09-08 11:49:37,772 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 507 transitions. Word has length 70 [2019-09-08 11:49:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:37,772 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 507 transitions. [2019-09-08 11:49:37,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 507 transitions. [2019-09-08 11:49:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:49:37,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:37,773 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] [2019-09-08 11:49:37,774 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash -34978696, now seen corresponding path program 1 times [2019-09-08 11:49:37,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:37,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:37,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:37,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:37,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:38,114 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:49:38,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:38,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:49:38,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:49:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:49:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:49:38,116 INFO L87 Difference]: Start difference. First operand 381 states and 507 transitions. Second operand 11 states. [2019-09-08 11:49:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:38,787 INFO L93 Difference]: Finished difference Result 865 states and 1214 transitions. [2019-09-08 11:49:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:49:38,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:49:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:38,791 INFO L225 Difference]: With dead ends: 865 [2019-09-08 11:49:38,791 INFO L226 Difference]: Without dead ends: 861 [2019-09-08 11:49:38,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:49:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-08 11:49:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 377. [2019-09-08 11:49:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 11:49:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2019-09-08 11:49:38,888 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 70 [2019-09-08 11:49:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:38,889 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2019-09-08 11:49:38,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:49:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2019-09-08 11:49:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:49:38,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:38,890 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] [2019-09-08 11:49:38,890 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash 292721495, now seen corresponding path program 1 times [2019-09-08 11:49:38,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:38,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:39,006 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:49:39,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:39,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:39,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:39,008 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand 9 states. [2019-09-08 11:49:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:39,747 INFO L93 Difference]: Finished difference Result 660 states and 900 transitions. [2019-09-08 11:49:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:49:39,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:49:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:39,751 INFO L225 Difference]: With dead ends: 660 [2019-09-08 11:49:39,751 INFO L226 Difference]: Without dead ends: 653 [2019-09-08 11:49:39,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:49:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-08 11:49:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 377. [2019-09-08 11:49:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 11:49:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 502 transitions. [2019-09-08 11:49:39,866 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 502 transitions. Word has length 71 [2019-09-08 11:49:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:39,867 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 502 transitions. [2019-09-08 11:49:39,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 502 transitions. [2019-09-08 11:49:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:49:39,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:39,869 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] [2019-09-08 11:49:39,870 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -288197998, now seen corresponding path program 1 times [2019-09-08 11:49:39,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:39,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:40,003 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:49:40,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:40,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:49:40,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:49:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:49:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:40,004 INFO L87 Difference]: Start difference. First operand 377 states and 502 transitions. Second operand 9 states. [2019-09-08 11:49:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:40,607 INFO L93 Difference]: Finished difference Result 660 states and 898 transitions. [2019-09-08 11:49:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:49:40,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:49:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:40,610 INFO L225 Difference]: With dead ends: 660 [2019-09-08 11:49:40,610 INFO L226 Difference]: Without dead ends: 653 [2019-09-08 11:49:40,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:49:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-08 11:49:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 377. [2019-09-08 11:49:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 11:49:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2019-09-08 11:49:40,677 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 71 [2019-09-08 11:49:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:40,677 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2019-09-08 11:49:40,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:49:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2019-09-08 11:49:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:49:40,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:40,678 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] [2019-09-08 11:49:40,678 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -256536824, now seen corresponding path program 1 times [2019-09-08 11:49:40,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:40,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:41,504 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:49:41,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:41,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:49:41,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:49:41,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:49:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:49:41,505 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand 23 states. [2019-09-08 11:49:41,763 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-08 11:49:42,519 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 11:49:42,734 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:49:42,967 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 11:49:43,128 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:49:43,276 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:49:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:45,733 INFO L93 Difference]: Finished difference Result 1504 states and 2174 transitions. [2019-09-08 11:49:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:49:45,734 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-09-08 11:49:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:45,740 INFO L225 Difference]: With dead ends: 1504 [2019-09-08 11:49:45,740 INFO L226 Difference]: Without dead ends: 1498 [2019-09-08 11:49:45,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 11:49:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-09-08 11:49:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 388. [2019-09-08 11:49:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:49:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 515 transitions. [2019-09-08 11:49:45,823 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 515 transitions. Word has length 72 [2019-09-08 11:49:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:45,823 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 515 transitions. [2019-09-08 11:49:45,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:49:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 515 transitions. [2019-09-08 11:49:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:49:45,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:45,824 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] [2019-09-08 11:49:45,825 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 424447858, now seen corresponding path program 1 times [2019-09-08 11:49:45,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:45,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:45,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:46,284 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:49:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:49:46,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:49:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:49:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:49:46,285 INFO L87 Difference]: Start difference. First operand 388 states and 515 transitions. Second operand 14 states. [2019-09-08 11:49:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:47,341 INFO L93 Difference]: Finished difference Result 413 states and 539 transitions. [2019-09-08 11:49:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:49:47,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-09-08 11:49:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:47,343 INFO L225 Difference]: With dead ends: 413 [2019-09-08 11:49:47,343 INFO L226 Difference]: Without dead ends: 393 [2019-09-08 11:49:47,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:49:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-08 11:49:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 383. [2019-09-08 11:49:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 11:49:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 509 transitions. [2019-09-08 11:49:47,422 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 509 transitions. Word has length 73 [2019-09-08 11:49:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:47,422 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 509 transitions. [2019-09-08 11:49:47,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:49:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 509 transitions. [2019-09-08 11:49:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:49:47,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:47,423 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] [2019-09-08 11:49:47,423 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1502313025, now seen corresponding path program 1 times [2019-09-08 11:49:47,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:47,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:48,265 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:49:48,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:48,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:49:48,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:49:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:49:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:49:48,266 INFO L87 Difference]: Start difference. First operand 383 states and 509 transitions. Second operand 19 states. [2019-09-08 11:49:48,847 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 11:49:49,027 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:49:49,168 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 11:49:49,303 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 11:49:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:51,299 INFO L93 Difference]: Finished difference Result 1018 states and 1438 transitions. [2019-09-08 11:49:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:49:51,300 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-09-08 11:49:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:51,303 INFO L225 Difference]: With dead ends: 1018 [2019-09-08 11:49:51,303 INFO L226 Difference]: Without dead ends: 1010 [2019-09-08 11:49:51,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:49:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-09-08 11:49:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 388. [2019-09-08 11:49:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:49:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 514 transitions. [2019-09-08 11:49:51,394 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 514 transitions. Word has length 73 [2019-09-08 11:49:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:51,394 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 514 transitions. [2019-09-08 11:49:51,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:49:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 514 transitions. [2019-09-08 11:49:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:49:51,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:51,395 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] [2019-09-08 11:49:51,395 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2067734093, now seen corresponding path program 1 times [2019-09-08 11:49:51,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:51,797 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:49:51,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:51,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:49:51,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:49:51,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:49:51,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:49:51,798 INFO L87 Difference]: Start difference. First operand 388 states and 514 transitions. Second operand 12 states. [2019-09-08 11:49:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:53,121 INFO L93 Difference]: Finished difference Result 1085 states and 1543 transitions. [2019-09-08 11:49:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:49:53,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 11:49:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:53,125 INFO L225 Difference]: With dead ends: 1085 [2019-09-08 11:49:53,125 INFO L226 Difference]: Without dead ends: 1079 [2019-09-08 11:49:53,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:49:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-08 11:49:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 371. [2019-09-08 11:49:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-08 11:49:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 493 transitions. [2019-09-08 11:49:53,210 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 493 transitions. Word has length 73 [2019-09-08 11:49:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:53,210 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 493 transitions. [2019-09-08 11:49:53,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:49:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 493 transitions. [2019-09-08 11:49:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:49:53,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:53,212 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] [2019-09-08 11:49:53,212 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1554071027, now seen corresponding path program 1 times [2019-09-08 11:49:53,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:53,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:53,618 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:49:53,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:49:53,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:49:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:49:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:49:53,619 INFO L87 Difference]: Start difference. First operand 371 states and 493 transitions. Second operand 13 states. [2019-09-08 11:49:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:54,648 INFO L93 Difference]: Finished difference Result 839 states and 1185 transitions. [2019-09-08 11:49:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:49:54,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-08 11:49:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:54,650 INFO L225 Difference]: With dead ends: 839 [2019-09-08 11:49:54,650 INFO L226 Difference]: Without dead ends: 821 [2019-09-08 11:49:54,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:49:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-08 11:49:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 353. [2019-09-08 11:49:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-08 11:49:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 473 transitions. [2019-09-08 11:49:54,776 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 473 transitions. Word has length 73 [2019-09-08 11:49:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:54,777 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 473 transitions. [2019-09-08 11:49:54,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:49:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 473 transitions. [2019-09-08 11:49:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:49:54,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:54,778 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] [2019-09-08 11:49:54,778 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1379799190, now seen corresponding path program 1 times [2019-09-08 11:49:54,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:55,124 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:49:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:55,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:49:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:49:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:49:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:49:55,126 INFO L87 Difference]: Start difference. First operand 353 states and 473 transitions. Second operand 10 states. [2019-09-08 11:49:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:55,705 INFO L93 Difference]: Finished difference Result 773 states and 1110 transitions. [2019-09-08 11:49:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:49:55,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 11:49:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:55,707 INFO L225 Difference]: With dead ends: 773 [2019-09-08 11:49:55,707 INFO L226 Difference]: Without dead ends: 744 [2019-09-08 11:49:55,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:49:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-08 11:49:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 324. [2019-09-08 11:49:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-08 11:49:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2019-09-08 11:49:55,789 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 74 [2019-09-08 11:49:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:55,789 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2019-09-08 11:49:55,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:49:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2019-09-08 11:49:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 11:49:55,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:55,790 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, 1, 1, 1] [2019-09-08 11:49:55,791 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 973327812, now seen corresponding path program 1 times [2019-09-08 11:49:55,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:55,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:55,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:55,845 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:49:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:55,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:55,847 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2019-09-08 11:49:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:56,036 INFO L93 Difference]: Finished difference Result 724 states and 1044 transitions. [2019-09-08 11:49:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:56,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 11:49:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:56,038 INFO L225 Difference]: With dead ends: 724 [2019-09-08 11:49:56,038 INFO L226 Difference]: Without dead ends: 516 [2019-09-08 11:49:56,038 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:49:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-08 11:49:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2019-09-08 11:49:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 11:49:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 722 transitions. [2019-09-08 11:49:56,201 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 722 transitions. Word has length 95 [2019-09-08 11:49:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:56,201 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 722 transitions. [2019-09-08 11:49:56,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:49:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 722 transitions. [2019-09-08 11:49:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:49:56,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:56,203 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, 1, 1, 1, 1, 1] [2019-09-08 11:49:56,203 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -338945445, now seen corresponding path program 1 times [2019-09-08 11:49:56,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:56,265 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:49:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:56,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:49:56,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:49:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:49:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:49:56,266 INFO L87 Difference]: Start difference. First operand 514 states and 722 transitions. Second operand 5 states. [2019-09-08 11:49:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:57,217 INFO L93 Difference]: Finished difference Result 2418 states and 3550 transitions. [2019-09-08 11:49:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:49:57,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:49:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:57,224 INFO L225 Difference]: With dead ends: 2418 [2019-09-08 11:49:57,224 INFO L226 Difference]: Without dead ends: 2020 [2019-09-08 11:49:57,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-08 11:49:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 950. [2019-09-08 11:49:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-08 11:49:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1358 transitions. [2019-09-08 11:49:57,670 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1358 transitions. Word has length 97 [2019-09-08 11:49:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:57,670 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1358 transitions. [2019-09-08 11:49:57,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:49:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1358 transitions. [2019-09-08 11:49:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:49:57,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:57,672 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, 1, 1, 1, 1, 1] [2019-09-08 11:49:57,672 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1085518228, now seen corresponding path program 1 times [2019-09-08 11:49:57,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:57,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:57,736 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:49:57,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:57,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:57,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:57,737 INFO L87 Difference]: Start difference. First operand 950 states and 1358 transitions. Second operand 3 states. [2019-09-08 11:49:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:58,229 INFO L93 Difference]: Finished difference Result 2200 states and 3188 transitions. [2019-09-08 11:49:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:58,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:49:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:58,233 INFO L225 Difference]: With dead ends: 2200 [2019-09-08 11:49:58,233 INFO L226 Difference]: Without dead ends: 1366 [2019-09-08 11:49:58,235 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:49:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-09-08 11:49:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1348. [2019-09-08 11:49:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-09-08 11:49:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1914 transitions. [2019-09-08 11:49:58,845 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1914 transitions. Word has length 97 [2019-09-08 11:49:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:58,846 INFO L475 AbstractCegarLoop]: Abstraction has 1348 states and 1914 transitions. [2019-09-08 11:49:58,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:49:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1914 transitions. [2019-09-08 11:49:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:49:58,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:58,848 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, 1, 1, 1, 1, 1] [2019-09-08 11:49:58,848 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1152011740, now seen corresponding path program 1 times [2019-09-08 11:49:58,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:58,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:58,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:58,904 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:49:58,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:58,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:58,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:58,905 INFO L87 Difference]: Start difference. First operand 1348 states and 1914 transitions. Second operand 3 states. [2019-09-08 11:49:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:59,578 INFO L93 Difference]: Finished difference Result 3236 states and 4654 transitions. [2019-09-08 11:49:59,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:59,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:49:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:59,582 INFO L225 Difference]: With dead ends: 3236 [2019-09-08 11:49:59,582 INFO L226 Difference]: Without dead ends: 2004 [2019-09-08 11:49:59,585 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:49:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-09-08 11:50:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2002. [2019-09-08 11:50:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-09-08 11:50:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2848 transitions. [2019-09-08 11:50:00,481 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2848 transitions. Word has length 97 [2019-09-08 11:50:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:00,482 INFO L475 AbstractCegarLoop]: Abstraction has 2002 states and 2848 transitions. [2019-09-08 11:50:00,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2848 transitions. [2019-09-08 11:50:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:50:00,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:00,484 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, 1, 1, 1, 1, 1] [2019-09-08 11:50:00,484 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1716786779, now seen corresponding path program 1 times [2019-09-08 11:50:00,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:00,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:00,541 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:50:00,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:00,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:00,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:00,542 INFO L87 Difference]: Start difference. First operand 2002 states and 2848 transitions. Second operand 5 states. [2019-09-08 11:50:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:03,433 INFO L93 Difference]: Finished difference Result 9474 states and 13524 transitions. [2019-09-08 11:50:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:03,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:50:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:03,449 INFO L225 Difference]: With dead ends: 9474 [2019-09-08 11:50:03,450 INFO L226 Difference]: Without dead ends: 7588 [2019-09-08 11:50:03,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2019-09-08 11:50:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 4030. [2019-09-08 11:50:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4030 states. [2019-09-08 11:50:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5714 transitions. [2019-09-08 11:50:04,973 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5714 transitions. Word has length 97 [2019-09-08 11:50:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:04,973 INFO L475 AbstractCegarLoop]: Abstraction has 4030 states and 5714 transitions. [2019-09-08 11:50:04,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5714 transitions. [2019-09-08 11:50:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:50:04,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:04,975 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, 1, 1, 1, 1, 1] [2019-09-08 11:50:04,975 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -703031205, now seen corresponding path program 1 times [2019-09-08 11:50:04,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:04,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:05,027 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:50:05,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:05,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:05,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:05,028 INFO L87 Difference]: Start difference. First operand 4030 states and 5714 transitions. Second operand 5 states. [2019-09-08 11:50:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:09,643 INFO L93 Difference]: Finished difference Result 17034 states and 24174 transitions. [2019-09-08 11:50:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:09,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:50:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:09,655 INFO L225 Difference]: With dead ends: 17034 [2019-09-08 11:50:09,655 INFO L226 Difference]: Without dead ends: 13120 [2019-09-08 11:50:09,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-09-08 11:50:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 8230. [2019-09-08 11:50:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8230 states. [2019-09-08 11:50:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 11590 transitions. [2019-09-08 11:50:12,526 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 11590 transitions. Word has length 97 [2019-09-08 11:50:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:12,526 INFO L475 AbstractCegarLoop]: Abstraction has 8230 states and 11590 transitions. [2019-09-08 11:50:12,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 11590 transitions. [2019-09-08 11:50:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:50:12,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:12,530 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:12,530 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -71633169, now seen corresponding path program 1 times [2019-09-08 11:50:12,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:12,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:12,583 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:50:12,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:12,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:12,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:12,585 INFO L87 Difference]: Start difference. First operand 8230 states and 11590 transitions. Second operand 3 states. [2019-09-08 11:50:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:15,737 INFO L93 Difference]: Finished difference Result 17178 states and 24216 transitions. [2019-09-08 11:50:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:50:15,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:50:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:15,746 INFO L225 Difference]: With dead ends: 17178 [2019-09-08 11:50:15,747 INFO L226 Difference]: Without dead ends: 9064 [2019-09-08 11:50:15,756 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:50:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-09-08 11:50:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 8966. [2019-09-08 11:50:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-09-08 11:50:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 12542 transitions. [2019-09-08 11:50:18,948 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 12542 transitions. Word has length 98 [2019-09-08 11:50:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:18,948 INFO L475 AbstractCegarLoop]: Abstraction has 8966 states and 12542 transitions. [2019-09-08 11:50:18,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 12542 transitions. [2019-09-08 11:50:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:50:18,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:18,951 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:18,951 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -755637834, now seen corresponding path program 1 times [2019-09-08 11:50:18,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:18,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:19,006 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:50:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:19,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:19,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:19,007 INFO L87 Difference]: Start difference. First operand 8966 states and 12542 transitions. Second operand 5 states. [2019-09-08 11:50:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:26,009 INFO L93 Difference]: Finished difference Result 27758 states and 38594 transitions. [2019-09-08 11:50:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:26,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:50:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:26,028 INFO L225 Difference]: With dead ends: 27758 [2019-09-08 11:50:26,028 INFO L226 Difference]: Without dead ends: 18908 [2019-09-08 11:50:26,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18908 states. [2019-09-08 11:50:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18908 to 11030. [2019-09-08 11:50:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11030 states. [2019-09-08 11:50:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 15182 transitions. [2019-09-08 11:50:29,979 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 15182 transitions. Word has length 98 [2019-09-08 11:50:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:29,979 INFO L475 AbstractCegarLoop]: Abstraction has 11030 states and 15182 transitions. [2019-09-08 11:50:29,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 15182 transitions. [2019-09-08 11:50:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:50:29,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:29,981 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:29,982 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 911061584, now seen corresponding path program 1 times [2019-09-08 11:50:29,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:29,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:30,054 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:50:30,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:30,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:50:30,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:50:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:50:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:30,055 INFO L87 Difference]: Start difference. First operand 11030 states and 15182 transitions. Second operand 6 states. [2019-09-08 11:50:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:37,036 INFO L93 Difference]: Finished difference Result 17590 states and 23731 transitions. [2019-09-08 11:50:37,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:37,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 11:50:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:37,051 INFO L225 Difference]: With dead ends: 17590 [2019-09-08 11:50:37,051 INFO L226 Difference]: Without dead ends: 17588 [2019-09-08 11:50:37,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17588 states. [2019-09-08 11:50:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17588 to 11222. [2019-09-08 11:50:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11222 states. [2019-09-08 11:50:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11222 states to 11222 states and 15310 transitions. [2019-09-08 11:50:41,017 INFO L78 Accepts]: Start accepts. Automaton has 11222 states and 15310 transitions. Word has length 98 [2019-09-08 11:50:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:41,018 INFO L475 AbstractCegarLoop]: Abstraction has 11222 states and 15310 transitions. [2019-09-08 11:50:41,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:50:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 11222 states and 15310 transitions. [2019-09-08 11:50:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:50:41,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:41,020 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:41,021 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2097306132, now seen corresponding path program 1 times [2019-09-08 11:50:41,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:41,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:41,080 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:50:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:41,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:41,081 INFO L87 Difference]: Start difference. First operand 11222 states and 15310 transitions. Second operand 3 states. [2019-09-08 11:50:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:45,060 INFO L93 Difference]: Finished difference Result 21706 states and 29552 transitions. [2019-09-08 11:50:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:50:45,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:50:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:45,070 INFO L225 Difference]: With dead ends: 21706 [2019-09-08 11:50:45,070 INFO L226 Difference]: Without dead ends: 10600 [2019-09-08 11:50:45,082 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:50:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2019-09-08 11:50:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 9250. [2019-09-08 11:50:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-09-08 11:50:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 12426 transitions. [2019-09-08 11:50:48,468 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 12426 transitions. Word has length 99 [2019-09-08 11:50:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:48,468 INFO L475 AbstractCegarLoop]: Abstraction has 9250 states and 12426 transitions. [2019-09-08 11:50:48,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 12426 transitions. [2019-09-08 11:50:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:50:48,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:48,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:48,470 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1226521472, now seen corresponding path program 1 times [2019-09-08 11:50:48,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:48,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:48,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:50:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:48,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:48,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:48,518 INFO L87 Difference]: Start difference. First operand 9250 states and 12426 transitions. Second operand 3 states. [2019-09-08 11:50:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:53,425 INFO L93 Difference]: Finished difference Result 22934 states and 30780 transitions. [2019-09-08 11:50:53,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:50:53,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:50:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:53,438 INFO L225 Difference]: With dead ends: 22934 [2019-09-08 11:50:53,438 INFO L226 Difference]: Without dead ends: 13800 [2019-09-08 11:50:53,448 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:50:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13800 states. [2019-09-08 11:50:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13800 to 9996. [2019-09-08 11:50:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2019-09-08 11:50:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 13258 transitions. [2019-09-08 11:50:57,115 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 13258 transitions. Word has length 100 [2019-09-08 11:50:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:57,116 INFO L475 AbstractCegarLoop]: Abstraction has 9996 states and 13258 transitions. [2019-09-08 11:50:57,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 13258 transitions. [2019-09-08 11:50:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:50:57,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:57,117 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:57,117 INFO L82 PathProgramCache]: Analyzing trace with hash -82823700, now seen corresponding path program 1 times [2019-09-08 11:50:57,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:57,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:57,172 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:50:57,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:57,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:57,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:57,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:57,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:57,174 INFO L87 Difference]: Start difference. First operand 9996 states and 13258 transitions. Second operand 3 states. [2019-09-08 11:51:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:01,848 INFO L93 Difference]: Finished difference Result 22004 states and 29024 transitions. [2019-09-08 11:51:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:51:01,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:51:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:01,859 INFO L225 Difference]: With dead ends: 22004 [2019-09-08 11:51:01,859 INFO L226 Difference]: Without dead ends: 12124 [2019-09-08 11:51:01,869 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:51:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12124 states. [2019-09-08 11:51:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12124 to 11494. [2019-09-08 11:51:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11494 states. [2019-09-08 11:51:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11494 states to 11494 states and 15030 transitions. [2019-09-08 11:51:06,208 INFO L78 Accepts]: Start accepts. Automaton has 11494 states and 15030 transitions. Word has length 101 [2019-09-08 11:51:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:06,209 INFO L475 AbstractCegarLoop]: Abstraction has 11494 states and 15030 transitions. [2019-09-08 11:51:06,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11494 states and 15030 transitions. [2019-09-08 11:51:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:51:06,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:06,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:06,210 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1734817196, now seen corresponding path program 1 times [2019-09-08 11:51:06,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:06,255 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:51:06,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:06,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:51:06,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:51:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:51:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:51:06,256 INFO L87 Difference]: Start difference. First operand 11494 states and 15030 transitions. Second operand 3 states. [2019-09-08 11:51:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:10,975 INFO L93 Difference]: Finished difference Result 23642 states and 30904 transitions. [2019-09-08 11:51:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:51:10,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:51:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:10,985 INFO L225 Difference]: With dead ends: 23642 [2019-09-08 11:51:10,985 INFO L226 Difference]: Without dead ends: 12264 [2019-09-08 11:51:10,993 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:51:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2019-09-08 11:51:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 11982. [2019-09-08 11:51:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11982 states. [2019-09-08 11:51:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11982 states to 11982 states and 15518 transitions. [2019-09-08 11:51:15,618 INFO L78 Accepts]: Start accepts. Automaton has 11982 states and 15518 transitions. Word has length 102 [2019-09-08 11:51:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:15,619 INFO L475 AbstractCegarLoop]: Abstraction has 11982 states and 15518 transitions. [2019-09-08 11:51:15,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11982 states and 15518 transitions. [2019-09-08 11:51:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:51:15,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:15,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:15,623 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1955395367, now seen corresponding path program 1 times [2019-09-08 11:51:15,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:15,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:15,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:51:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:15,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:51:15,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:51:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:51:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:51:15,736 INFO L87 Difference]: Start difference. First operand 11982 states and 15518 transitions. Second operand 6 states. [2019-09-08 11:51:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:34,231 INFO L93 Difference]: Finished difference Result 59832 states and 77307 transitions. [2019-09-08 11:51:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:51:34,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 11:51:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:34,276 INFO L225 Difference]: With dead ends: 59832 [2019-09-08 11:51:34,276 INFO L226 Difference]: Without dead ends: 47966 [2019-09-08 11:51:34,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47966 states. [2019-09-08 11:51:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47966 to 19662. [2019-09-08 11:51:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-09-08 11:51:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 25326 transitions. [2019-09-08 11:51:42,602 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 25326 transitions. Word has length 126 [2019-09-08 11:51:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:42,602 INFO L475 AbstractCegarLoop]: Abstraction has 19662 states and 25326 transitions. [2019-09-08 11:51:42,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:51:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 25326 transitions. [2019-09-08 11:51:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:51:42,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:42,606 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:42,606 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 100336857, now seen corresponding path program 1 times [2019-09-08 11:51:42,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:42,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:51:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:51:42,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:51:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:51:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:51:42,717 INFO L87 Difference]: Start difference. First operand 19662 states and 25326 transitions. Second operand 6 states. [2019-09-08 11:52:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:05,012 INFO L93 Difference]: Finished difference Result 66912 states and 86299 transitions. [2019-09-08 11:52:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:52:05,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 11:52:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:05,066 INFO L225 Difference]: With dead ends: 66912 [2019-09-08 11:52:05,066 INFO L226 Difference]: Without dead ends: 55046 [2019-09-08 11:52:05,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:52:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55046 states. [2019-09-08 11:52:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55046 to 31118. [2019-09-08 11:52:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31118 states. [2019-09-08 11:52:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31118 states to 31118 states and 39878 transitions. [2019-09-08 11:52:17,819 INFO L78 Accepts]: Start accepts. Automaton has 31118 states and 39878 transitions. Word has length 126 [2019-09-08 11:52:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:17,819 INFO L475 AbstractCegarLoop]: Abstraction has 31118 states and 39878 transitions. [2019-09-08 11:52:17,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:52:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 31118 states and 39878 transitions. [2019-09-08 11:52:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:52:17,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:17,823 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:17,823 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1975486169, now seen corresponding path program 1 times [2019-09-08 11:52:17,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:17,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:17,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:17,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:17,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:17,887 INFO L87 Difference]: Start difference. First operand 31118 states and 39878 transitions. Second operand 3 states. [2019-09-08 11:52:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:30,098 INFO L93 Difference]: Finished difference Result 58698 states and 74688 transitions. [2019-09-08 11:52:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:30,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:52:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:30,123 INFO L225 Difference]: With dead ends: 58698 [2019-09-08 11:52:30,123 INFO L226 Difference]: Without dead ends: 27696 [2019-09-08 11:52:30,149 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:52:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27696 states. [2019-09-08 11:52:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27696 to 27574. [2019-09-08 11:52:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27574 states. [2019-09-08 11:52:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27574 states to 27574 states and 34262 transitions. [2019-09-08 11:52:41,584 INFO L78 Accepts]: Start accepts. Automaton has 27574 states and 34262 transitions. Word has length 126 [2019-09-08 11:52:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:41,584 INFO L475 AbstractCegarLoop]: Abstraction has 27574 states and 34262 transitions. [2019-09-08 11:52:41,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27574 states and 34262 transitions. [2019-09-08 11:52:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:52:41,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:41,589 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:41,589 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash -430522632, now seen corresponding path program 1 times [2019-09-08 11:52:41,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:41,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:41,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:41,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:52:41,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:41,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:52:41,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:52:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:52:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:52:41,710 INFO L87 Difference]: Start difference. First operand 27574 states and 34262 transitions. Second operand 6 states. [2019-09-08 11:53:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:05,133 INFO L93 Difference]: Finished difference Result 63992 states and 79983 transitions. [2019-09-08 11:53:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:53:05,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 11:53:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:05,187 INFO L225 Difference]: With dead ends: 63992 [2019-09-08 11:53:05,187 INFO L226 Difference]: Without dead ends: 54310 [2019-09-08 11:53:05,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:53:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54310 states. [2019-09-08 11:53:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54310 to 34710. [2019-09-08 11:53:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34710 states. [2019-09-08 11:53:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34710 states to 34710 states and 43110 transitions. [2019-09-08 11:53:20,028 INFO L78 Accepts]: Start accepts. Automaton has 34710 states and 43110 transitions. Word has length 127 [2019-09-08 11:53:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:20,028 INFO L475 AbstractCegarLoop]: Abstraction has 34710 states and 43110 transitions. [2019-09-08 11:53:20,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:53:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34710 states and 43110 transitions. [2019-09-08 11:53:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:53:20,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:20,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:53:20,032 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:20,032 INFO L82 PathProgramCache]: Analyzing trace with hash 674022136, now seen corresponding path program 1 times [2019-09-08 11:53:20,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:20,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:20,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:20,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:53:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:53:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:53:20,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:53:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:53:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:53:20,144 INFO L87 Difference]: Start difference. First operand 34710 states and 43110 transitions. Second operand 6 states. [2019-09-08 11:53:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:46,973 INFO L93 Difference]: Finished difference Result 70888 states and 88519 transitions. [2019-09-08 11:53:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:53:46,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 11:53:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:47,032 INFO L225 Difference]: With dead ends: 70888 [2019-09-08 11:53:47,032 INFO L226 Difference]: Without dead ends: 61206 [2019-09-08 11:53:47,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:53:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61206 states. [2019-09-08 11:54:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61206 to 41846. [2019-09-08 11:54:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-08 11:54:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 51958 transitions. [2019-09-08 11:54:05,327 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 51958 transitions. Word has length 127 [2019-09-08 11:54:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:54:05,327 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 51958 transitions. [2019-09-08 11:54:05,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:54:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 51958 transitions. [2019-09-08 11:54:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:54:05,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:54:05,332 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:54:05,332 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:54:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:54:05,333 INFO L82 PathProgramCache]: Analyzing trace with hash -827875054, now seen corresponding path program 1 times [2019-09-08 11:54:05,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:54:05,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:54:05,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:05,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:05,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 11:54:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:54:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:54:05,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:54:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:54:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:54:05,469 INFO L87 Difference]: Start difference. First operand 41846 states and 51958 transitions. Second operand 9 states. [2019-09-08 11:54:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:54:42,404 INFO L93 Difference]: Finished difference Result 125358 states and 155680 transitions. [2019-09-08 11:54:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:54:42,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 11:54:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:54:42,484 INFO L225 Difference]: With dead ends: 125358 [2019-09-08 11:54:42,484 INFO L226 Difference]: Without dead ends: 83616 [2019-09-08 11:54:42,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:54:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83616 states. [2019-09-08 11:55:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83616 to 41846. [2019-09-08 11:55:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-08 11:55:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 51956 transitions. [2019-09-08 11:55:03,194 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 51956 transitions. Word has length 128 [2019-09-08 11:55:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:03,194 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 51956 transitions. [2019-09-08 11:55:03,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:55:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 51956 transitions. [2019-09-08 11:55:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:55:03,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:03,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:03,199 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1614558263, now seen corresponding path program 1 times [2019-09-08 11:55:03,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:03,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:55:03,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:55:03,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:03,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:55:03,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:55:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:55:04,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:55:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:04,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:55:04,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 11:55:04,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:55:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:55:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:55:04,516 INFO L87 Difference]: Start difference. First operand 41846 states and 51956 transitions. Second operand 20 states. [2019-09-08 11:55:04,806 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:55:05,299 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:55:05,713 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 11:55:05,948 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:55:06,434 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 11:55:06,644 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 11:55:07,241 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 11:55:07,587 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:55:07,868 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:55:08,097 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:55:08,386 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:55:08,691 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 11:55:09,084 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 11:55:09,481 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:55:09,775 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:55:10,057 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:55:10,783 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:55:11,022 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 11:55:11,355 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 11:55:11,695 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:55:12,125 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:55:12,432 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 11:55:12,782 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:55:13,224 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:55:13,704 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 11:55:14,068 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:55:14,444 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 11:55:15,021 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 11:55:15,870 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:55:16,146 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:55:16,439 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 11:55:16,854 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 11:55:17,209 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 11:55:17,643 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 11:55:19,104 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:55:19,662 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:55:20,209 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:55:20,742 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 11:55:21,068 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:55:21,608 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:55:21,898 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:55:22,301 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:55:22,670 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:55:23,080 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 11:55:23,463 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 11:55:23,968 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-08 11:55:24,542 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:55:24,946 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 11:55:25,385 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 11:55:25,736 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 11:55:26,161 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 11:55:26,527 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:55:27,102 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-08 11:55:27,461 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-08 11:55:27,957 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:55:28,384 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 11:55:28,877 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:55:29,138 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 11:55:29,681 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-08 11:55:30,276 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 11:55:30,645 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:55:31,021 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 11:55:31,452 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:55:31,821 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-08 11:55:32,144 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-08 11:55:32,568 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 11:55:32,885 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:55:33,208 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 11:55:33,635 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 11:55:34,095 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 11:55:34,368 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 11:55:34,658 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:55:35,296 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:55:35,692 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 11:55:38,897 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:55:39,869 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 11:55:40,227 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:55:41,216 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:55:41,631 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:55:41,915 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:55:42,265 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:55:43,134 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 11:55:43,542 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-08 11:55:43,965 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 11:55:44,255 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 11:55:44,605 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:55:45,367 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 11:55:45,808 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 11:55:46,114 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 11:55:46,442 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 11:55:46,778 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:55:48,529 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 11:55:49,398 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 11:55:49,755 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-08 11:55:50,135 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:55:50,704 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:55:51,148 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 11:55:57,567 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 11:55:58,158 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:55:59,187 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 11:55:59,732 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:56:00,258 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:56:00,661 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 11:56:01,389 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:56:02,263 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 11:56:09,316 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:56:10,030 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:56:10,879 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:56:11,477 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:56:12,869 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:56:13,907 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:56:14,493 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:56:15,555 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:56:20,305 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:56:20,618 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:56:21,206 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:56:23,140 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 11:56:24,081 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:56:24,482 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 11:56:25,307 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 11:57:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:11,504 INFO L93 Difference]: Finished difference Result 190797 states and 235695 transitions. [2019-09-08 11:57:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 11:57:11,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 130 [2019-09-08 11:57:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:11,856 INFO L225 Difference]: With dead ends: 190797 [2019-09-08 11:57:11,856 INFO L226 Difference]: Without dead ends: 149067 [2019-09-08 11:57:11,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7274 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=3777, Invalid=16529, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 11:57:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149067 states. [2019-09-08 11:58:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149067 to 77053. [2019-09-08 11:58:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77053 states. [2019-09-08 11:58:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77053 states to 77053 states and 95209 transitions. [2019-09-08 11:58:04,422 INFO L78 Accepts]: Start accepts. Automaton has 77053 states and 95209 transitions. Word has length 130 [2019-09-08 11:58:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:04,423 INFO L475 AbstractCegarLoop]: Abstraction has 77053 states and 95209 transitions. [2019-09-08 11:58:04,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:58:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 77053 states and 95209 transitions. [2019-09-08 11:58:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:58:04,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:04,436 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:58:04,436 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1802869750, now seen corresponding path program 1 times [2019-09-08 11:58:04,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:04,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:04,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:58:04,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:58:04,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:58:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:05,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:58:05,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:58:05,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:58:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:58:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:58:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:58:05,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:58:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:58:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:58:05,817 INFO L87 Difference]: Start difference. First operand 77053 states and 95209 transitions. Second operand 20 states. [2019-09-08 11:58:06,219 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:58:06,645 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 11:58:06,977 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:58:07,170 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:58:07,730 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:58:07,947 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:58:08,447 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:58:09,031 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:58:09,374 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:58:09,668 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:58:10,195 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:58:10,403 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:58:10,650 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:58:10,967 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:58:12,491 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:58:12,750 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:58:27,218 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:58:28,122 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:58:28,432 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:58:32,505 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:59:15,811 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:01:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:00,152 INFO L93 Difference]: Finished difference Result 305655 states and 374531 transitions. [2019-09-08 12:01:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:01:00,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2019-09-08 12:01:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:00,506 INFO L225 Difference]: With dead ends: 305655 [2019-09-08 12:01:00,507 INFO L226 Difference]: Without dead ends: 228759 [2019-09-08 12:01:00,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=496, Invalid=1310, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:01:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228759 states.