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.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:01:54,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:01:54,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:01:54,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:01:54,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:01:54,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:01:54,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:01:54,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:01:54,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:01:54,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:01:54,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:01:54,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:01:54,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:01:54,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:01:54,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:01:54,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:01:54,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:01:54,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:01:54,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:01:54,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:01:54,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:01:54,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:01:54,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:01:54,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:01:54,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:01:54,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:01:54,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:01:54,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:01:54,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:01:54,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:01:54,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:01:54,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:01:54,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:01:54,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:01:54,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:01:54,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:01:54,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:01:54,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:01:54,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:01:54,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:01:54,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:01:54,289 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 12:01:54,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:01:54,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:01:54,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:01:54,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:01:54,306 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:01:54,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:01:54,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:01:54,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:01:54,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:01:54,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:01:54,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:01:54,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:01:54,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:01:54,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:01:54,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:01:54,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:01:54,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:01:54,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:01:54,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:01:54,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:01:54,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:01:54,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:01:54,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:01:54,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:01:54,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:01:54,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:01:54,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:01:54,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:01:54,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:01:54,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:01:54,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:01:54,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:01:54,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:01:54,358 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:01:54,359 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:01:54,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85758c7a3/381ce0011f824d63a6cd90f510cabd2a/FLAGb11a4d7c3 [2019-09-08 12:01:55,121 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:01:55,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:01:55,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85758c7a3/381ce0011f824d63a6cd90f510cabd2a/FLAGb11a4d7c3 [2019-09-08 12:01:55,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85758c7a3/381ce0011f824d63a6cd90f510cabd2a [2019-09-08 12:01:55,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:01:55,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:01:55,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:01:55,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:01:55,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:01:55,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:01:55" (1/1) ... [2019-09-08 12:01:55,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5943fbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:55, skipping insertion in model container [2019-09-08 12:01:55,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:01:55" (1/1) ... [2019-09-08 12:01:55,265 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:01:55,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:01:56,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:01:56,585 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:01:57,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:01:57,046 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:01:57,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57 WrapperNode [2019-09-08 12:01:57,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:01:57,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:01:57,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:01:57,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:01:57,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (1/1) ... [2019-09-08 12:01:57,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:01:57,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:01:57,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:01:57,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:01:57,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01: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 12:01:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:01:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:01:57,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:01:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:01:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:01:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:01:57,439 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:01:57,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:01:57,440 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:01:57,440 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:01:57,440 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:01:57,441 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:01:57,441 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:01:57,441 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:01:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:01:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:01:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:01:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:01:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:01:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:02:01,359 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:02:01,360 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:02:01,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:02:01 BoogieIcfgContainer [2019-09-08 12:02:01,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:02:01,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:02:01,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:02:01,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:02:01,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:01:55" (1/3) ... [2019-09-08 12:02:01,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc03d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:02:01, skipping insertion in model container [2019-09-08 12:02:01,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:01:57" (2/3) ... [2019-09-08 12:02:01,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc03d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:02:01, skipping insertion in model container [2019-09-08 12:02:01,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:02:01" (3/3) ... [2019-09-08 12:02:01,376 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:02:01,389 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:02:01,413 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:02:01,435 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:02:01,495 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:02:01,496 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:02:01,496 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:02:01,497 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:02:01,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:02:01,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:02:01,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:02:01,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:02:01,498 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:02:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states. [2019-09-08 12:02:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:02:01,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:01,560 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] [2019-09-08 12:02:01,563 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1025872216, now seen corresponding path program 1 times [2019-09-08 12:02:01,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:01,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:01,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:01,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:02,328 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 12:02:02,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:02,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:02,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:02,357 INFO L87 Difference]: Start difference. First operand 1198 states. Second operand 5 states. [2019-09-08 12:02:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:04,188 INFO L93 Difference]: Finished difference Result 1982 states and 3336 transitions. [2019-09-08 12:02:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:04,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:02:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:04,216 INFO L225 Difference]: With dead ends: 1982 [2019-09-08 12:02:04,216 INFO L226 Difference]: Without dead ends: 1367 [2019-09-08 12:02:04,224 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 12:02:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-09-08 12:02:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1251. [2019-09-08 12:02:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-09-08 12:02:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1633 transitions. [2019-09-08 12:02:04,380 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1633 transitions. Word has length 77 [2019-09-08 12:02:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:04,380 INFO L475 AbstractCegarLoop]: Abstraction has 1251 states and 1633 transitions. [2019-09-08 12:02:04,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1633 transitions. [2019-09-08 12:02:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:02:04,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:04,392 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] [2019-09-08 12:02:04,393 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:04,394 INFO L82 PathProgramCache]: Analyzing trace with hash -991361587, now seen corresponding path program 1 times [2019-09-08 12:02:04,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:04,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:04,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:04,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:04,709 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 12:02:04,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:04,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:04,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:04,714 INFO L87 Difference]: Start difference. First operand 1251 states and 1633 transitions. Second operand 5 states. [2019-09-08 12:02:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:05,283 INFO L93 Difference]: Finished difference Result 1463 states and 1909 transitions. [2019-09-08 12:02:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:05,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:02:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:05,292 INFO L225 Difference]: With dead ends: 1463 [2019-09-08 12:02:05,293 INFO L226 Difference]: Without dead ends: 838 [2019-09-08 12:02:05,296 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 12:02:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-08 12:02:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-08 12:02:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-08 12:02:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1096 transitions. [2019-09-08 12:02:05,344 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1096 transitions. Word has length 77 [2019-09-08 12:02:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:05,346 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1096 transitions. [2019-09-08 12:02:05,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1096 transitions. [2019-09-08 12:02:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:02:05,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:05,350 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] [2019-09-08 12:02:05,351 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2088333632, now seen corresponding path program 1 times [2019-09-08 12:02:05,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:05,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:05,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:05,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:05,570 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 12:02:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:05,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:05,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:05,574 INFO L87 Difference]: Start difference. First operand 838 states and 1096 transitions. Second operand 5 states. [2019-09-08 12:02:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:06,077 INFO L93 Difference]: Finished difference Result 1162 states and 1533 transitions. [2019-09-08 12:02:06,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:06,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:02:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:06,083 INFO L225 Difference]: With dead ends: 1162 [2019-09-08 12:02:06,083 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:02:06,092 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 12:02:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:02:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2019-09-08 12:02:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-09-08 12:02:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 939 transitions. [2019-09-08 12:02:06,126 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 939 transitions. Word has length 77 [2019-09-08 12:02:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:06,127 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 939 transitions. [2019-09-08 12:02:06,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 939 transitions. [2019-09-08 12:02:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:02:06,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:06,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:06,132 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2006758657, now seen corresponding path program 1 times [2019-09-08 12:02:06,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:06,312 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 12:02:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:06,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:06,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:06,316 INFO L87 Difference]: Start difference. First operand 711 states and 939 transitions. Second operand 5 states. [2019-09-08 12:02:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:07,012 INFO L93 Difference]: Finished difference Result 1032 states and 1373 transitions. [2019-09-08 12:02:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:07,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 12:02:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:07,021 INFO L225 Difference]: With dead ends: 1032 [2019-09-08 12:02:07,021 INFO L226 Difference]: Without dead ends: 695 [2019-09-08 12:02:07,023 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 12:02:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-08 12:02:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2019-09-08 12:02:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-09-08 12:02:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 919 transitions. [2019-09-08 12:02:07,061 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 919 transitions. Word has length 79 [2019-09-08 12:02:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:07,062 INFO L475 AbstractCegarLoop]: Abstraction has 695 states and 919 transitions. [2019-09-08 12:02:07,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 919 transitions. [2019-09-08 12:02:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:02:07,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:07,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:07,065 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 748510916, now seen corresponding path program 1 times [2019-09-08 12:02:07,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:07,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:07,231 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 12:02:07,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:07,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:02:07,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:02:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:02:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:02:07,234 INFO L87 Difference]: Start difference. First operand 695 states and 919 transitions. Second operand 5 states. [2019-09-08 12:02:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:07,595 INFO L93 Difference]: Finished difference Result 970 states and 1285 transitions. [2019-09-08 12:02:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:02:07,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:02:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:07,599 INFO L225 Difference]: With dead ends: 970 [2019-09-08 12:02:07,599 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 12:02:07,601 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 12:02:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 12:02:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 12:02:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 782 transitions. [2019-09-08 12:02:07,665 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 782 transitions. Word has length 81 [2019-09-08 12:02:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:07,666 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 782 transitions. [2019-09-08 12:02:07,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:02:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 782 transitions. [2019-09-08 12:02:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:02:07,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:07,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:07,669 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash -763074199, now seen corresponding path program 1 times [2019-09-08 12:02:07,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:07,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:07,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:07,942 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 12:02:07,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:07,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:02:07,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:02:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:02:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:02:07,944 INFO L87 Difference]: Start difference. First operand 591 states and 782 transitions. Second operand 8 states. [2019-09-08 12:02:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:08,714 INFO L93 Difference]: Finished difference Result 1132 states and 1479 transitions. [2019-09-08 12:02:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:02:08,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 12:02:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:08,720 INFO L225 Difference]: With dead ends: 1132 [2019-09-08 12:02:08,721 INFO L226 Difference]: Without dead ends: 840 [2019-09-08 12:02:08,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:02:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-09-08 12:02:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 591. [2019-09-08 12:02:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 781 transitions. [2019-09-08 12:02:08,782 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 781 transitions. Word has length 83 [2019-09-08 12:02:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:08,782 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 781 transitions. [2019-09-08 12:02:08,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:02:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 781 transitions. [2019-09-08 12:02:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:02:08,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:08,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:08,786 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 847032169, now seen corresponding path program 1 times [2019-09-08 12:02:08,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:08,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:09,046 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 12:02:09,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:09,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:09,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:09,048 INFO L87 Difference]: Start difference. First operand 591 states and 781 transitions. Second operand 9 states. [2019-09-08 12:02:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:10,782 INFO L93 Difference]: Finished difference Result 1123 states and 1549 transitions. [2019-09-08 12:02:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:02:10,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:02:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:10,789 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 12:02:10,789 INFO L226 Difference]: Without dead ends: 923 [2019-09-08 12:02:10,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:02:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-08 12:02:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 591. [2019-09-08 12:02:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 780 transitions. [2019-09-08 12:02:10,855 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 780 transitions. Word has length 83 [2019-09-08 12:02:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:10,855 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 780 transitions. [2019-09-08 12:02:10,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 780 transitions. [2019-09-08 12:02:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:02:10,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:10,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:10,858 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash 560401961, now seen corresponding path program 1 times [2019-09-08 12:02:10,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:11,106 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 12:02:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:11,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:11,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:11,109 INFO L87 Difference]: Start difference. First operand 591 states and 780 transitions. Second operand 9 states. [2019-09-08 12:02:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:12,609 INFO L93 Difference]: Finished difference Result 1359 states and 1866 transitions. [2019-09-08 12:02:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:12,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:02:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:12,617 INFO L225 Difference]: With dead ends: 1359 [2019-09-08 12:02:12,617 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:02:12,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:02:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-08 12:02:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 779 transitions. [2019-09-08 12:02:12,663 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 779 transitions. Word has length 83 [2019-09-08 12:02:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:12,664 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 779 transitions. [2019-09-08 12:02:12,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 779 transitions. [2019-09-08 12:02:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:02:12,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:12,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:12,666 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1854316557, now seen corresponding path program 1 times [2019-09-08 12:02:12,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:12,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 12:02:12,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:12,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:12,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:12,918 INFO L87 Difference]: Start difference. First operand 591 states and 779 transitions. Second operand 9 states. [2019-09-08 12:02:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:14,376 INFO L93 Difference]: Finished difference Result 1314 states and 1798 transitions. [2019-09-08 12:02:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:14,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:02:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:14,384 INFO L225 Difference]: With dead ends: 1314 [2019-09-08 12:02:14,384 INFO L226 Difference]: Without dead ends: 1176 [2019-09-08 12:02:14,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-08 12:02:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-08 12:02:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 778 transitions. [2019-09-08 12:02:14,531 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 778 transitions. Word has length 84 [2019-09-08 12:02:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:14,532 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 778 transitions. [2019-09-08 12:02:14,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 778 transitions. [2019-09-08 12:02:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:14,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:14,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:14,536 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash -15576114, now seen corresponding path program 1 times [2019-09-08 12:02:14,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:14,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:14,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:14,841 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 12:02:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:14,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:14,842 INFO L87 Difference]: Start difference. First operand 591 states and 778 transitions. Second operand 9 states. [2019-09-08 12:02:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:16,360 INFO L93 Difference]: Finished difference Result 1379 states and 1888 transitions. [2019-09-08 12:02:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:16,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:16,367 INFO L225 Difference]: With dead ends: 1379 [2019-09-08 12:02:16,367 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:02:16,369 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 12:02:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:02:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-08 12:02:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 776 transitions. [2019-09-08 12:02:16,421 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 776 transitions. Word has length 85 [2019-09-08 12:02:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:16,422 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 776 transitions. [2019-09-08 12:02:16,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 776 transitions. [2019-09-08 12:02:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:16,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:16,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:16,424 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1212918770, now seen corresponding path program 1 times [2019-09-08 12:02:16,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:16,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:16,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:16,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:16,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:16,609 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 12:02:16,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:16,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:16,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:16,611 INFO L87 Difference]: Start difference. First operand 591 states and 776 transitions. Second operand 9 states. [2019-09-08 12:02:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:17,947 INFO L93 Difference]: Finished difference Result 1325 states and 1808 transitions. [2019-09-08 12:02:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:17,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:17,954 INFO L225 Difference]: With dead ends: 1325 [2019-09-08 12:02:17,954 INFO L226 Difference]: Without dead ends: 1176 [2019-09-08 12:02:17,956 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 12:02:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-08 12:02:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-08 12:02:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 774 transitions. [2019-09-08 12:02:18,011 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 774 transitions. Word has length 85 [2019-09-08 12:02:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:18,012 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 774 transitions. [2019-09-08 12:02:18,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 774 transitions. [2019-09-08 12:02:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:18,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:18,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:18,014 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1860056526, now seen corresponding path program 1 times [2019-09-08 12:02:18,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:18,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:18,221 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 12:02:18,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:18,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:18,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:18,223 INFO L87 Difference]: Start difference. First operand 591 states and 774 transitions. Second operand 9 states. [2019-09-08 12:02:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:19,627 INFO L93 Difference]: Finished difference Result 1195 states and 1636 transitions. [2019-09-08 12:02:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:02:19,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:19,633 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:02:19,633 INFO L226 Difference]: Without dead ends: 923 [2019-09-08 12:02:19,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:02:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-08 12:02:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 591. [2019-09-08 12:02:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 772 transitions. [2019-09-08 12:02:19,727 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 772 transitions. Word has length 85 [2019-09-08 12:02:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:19,727 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 772 transitions. [2019-09-08 12:02:19,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 772 transitions. [2019-09-08 12:02:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:19,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:19,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:19,732 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash 920806414, now seen corresponding path program 1 times [2019-09-08 12:02:19,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:19,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:19,925 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 12:02:19,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:19,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:19,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:19,927 INFO L87 Difference]: Start difference. First operand 591 states and 772 transitions. Second operand 9 states. [2019-09-08 12:02:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:21,495 INFO L93 Difference]: Finished difference Result 1368 states and 1867 transitions. [2019-09-08 12:02:21,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:21,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:21,503 INFO L225 Difference]: With dead ends: 1368 [2019-09-08 12:02:21,503 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:02:21,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:02:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-08 12:02:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 771 transitions. [2019-09-08 12:02:21,561 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 771 transitions. Word has length 85 [2019-09-08 12:02:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:21,562 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 771 transitions. [2019-09-08 12:02:21,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 771 transitions. [2019-09-08 12:02:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:21,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:21,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:21,564 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1035004846, now seen corresponding path program 1 times [2019-09-08 12:02:21,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:21,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:21,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:21,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:21,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:21,757 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 12:02:21,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:21,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:21,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:21,759 INFO L87 Difference]: Start difference. First operand 591 states and 771 transitions. Second operand 9 states. [2019-09-08 12:02:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:23,114 INFO L93 Difference]: Finished difference Result 1318 states and 1794 transitions. [2019-09-08 12:02:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:23,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:23,119 INFO L225 Difference]: With dead ends: 1318 [2019-09-08 12:02:23,120 INFO L226 Difference]: Without dead ends: 1176 [2019-09-08 12:02:23,121 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 12:02:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-08 12:02:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-08 12:02:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 12:02:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-09-08 12:02:23,178 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 85 [2019-09-08 12:02:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:23,178 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-09-08 12:02:23,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-09-08 12:02:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:23,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:23,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:23,181 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1147266175, now seen corresponding path program 1 times [2019-09-08 12:02:23,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:23,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:23,377 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 12:02:23,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:23,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:23,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:23,379 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 9 states. [2019-09-08 12:02:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:24,678 INFO L93 Difference]: Finished difference Result 1280 states and 1734 transitions. [2019-09-08 12:02:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:24,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:24,684 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 12:02:24,684 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:24,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 768 transitions. [2019-09-08 12:02:24,746 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 768 transitions. Word has length 85 [2019-09-08 12:02:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:24,746 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 768 transitions. [2019-09-08 12:02:24,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 768 transitions. [2019-09-08 12:02:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:02:24,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:24,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:24,749 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash -207377138, now seen corresponding path program 1 times [2019-09-08 12:02:24,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:24,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:24,934 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 12:02:24,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:24,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:24,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:24,936 INFO L87 Difference]: Start difference. First operand 590 states and 768 transitions. Second operand 9 states. [2019-09-08 12:02:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:26,320 INFO L93 Difference]: Finished difference Result 1317 states and 1790 transitions. [2019-09-08 12:02:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:26,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:02:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:26,327 INFO L225 Difference]: With dead ends: 1317 [2019-09-08 12:02:26,327 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:02:26,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:02:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-08 12:02:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 767 transitions. [2019-09-08 12:02:26,392 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 767 transitions. Word has length 85 [2019-09-08 12:02:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:26,393 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 767 transitions. [2019-09-08 12:02:26,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 767 transitions. [2019-09-08 12:02:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:02:26,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:26,395 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash -669368786, now seen corresponding path program 1 times [2019-09-08 12:02:26,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:26,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:26,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:26,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:26,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:26,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 12:02:26,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:26,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:26,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:26,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:26,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:26,585 INFO L87 Difference]: Start difference. First operand 590 states and 767 transitions. Second operand 9 states. [2019-09-08 12:02:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:28,104 INFO L93 Difference]: Finished difference Result 1285 states and 1737 transitions. [2019-09-08 12:02:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:28,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:02:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:28,108 INFO L225 Difference]: With dead ends: 1285 [2019-09-08 12:02:28,108 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:28,109 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 12:02:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 765 transitions. [2019-09-08 12:02:28,172 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 765 transitions. Word has length 86 [2019-09-08 12:02:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:28,172 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 765 transitions. [2019-09-08 12:02:28,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 765 transitions. [2019-09-08 12:02:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:02:28,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:28,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:28,174 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:28,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1385395406, now seen corresponding path program 1 times [2019-09-08 12:02:28,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:28,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:28,354 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 12:02:28,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:28,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:28,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:28,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:28,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:28,356 INFO L87 Difference]: Start difference. First operand 590 states and 765 transitions. Second operand 9 states. [2019-09-08 12:02:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:29,900 INFO L93 Difference]: Finished difference Result 1282 states and 1732 transitions. [2019-09-08 12:02:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:29,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:02:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:29,906 INFO L225 Difference]: With dead ends: 1282 [2019-09-08 12:02:29,906 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:29,907 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 12:02:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 764 transitions. [2019-09-08 12:02:29,978 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 764 transitions. Word has length 86 [2019-09-08 12:02:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:29,978 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 764 transitions. [2019-09-08 12:02:29,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 764 transitions. [2019-09-08 12:02:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:02:29,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02: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] [2019-09-08 12:02:29,981 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 858512238, now seen corresponding path program 1 times [2019-09-08 12:02:29,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:29,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:29,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:30,173 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 12:02:30,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:30,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:30,175 INFO L87 Difference]: Start difference. First operand 590 states and 764 transitions. Second operand 9 states. [2019-09-08 12:02:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:31,781 INFO L93 Difference]: Finished difference Result 1282 states and 1731 transitions. [2019-09-08 12:02:31,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:31,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:02:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:31,785 INFO L225 Difference]: With dead ends: 1282 [2019-09-08 12:02:31,785 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:31,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 763 transitions. [2019-09-08 12:02:31,842 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 763 transitions. Word has length 86 [2019-09-08 12:02:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:31,843 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 763 transitions. [2019-09-08 12:02:31,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 763 transitions. [2019-09-08 12:02:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:02:31,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:31,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:31,846 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:31,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1124465518, now seen corresponding path program 1 times [2019-09-08 12:02:31,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:31,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:31,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:32,016 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 12:02:32,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:32,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:32,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:32,018 INFO L87 Difference]: Start difference. First operand 590 states and 763 transitions. Second operand 9 states. [2019-09-08 12:02:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:33,472 INFO L93 Difference]: Finished difference Result 1282 states and 1729 transitions. [2019-09-08 12:02:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:33,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:02:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:33,477 INFO L225 Difference]: With dead ends: 1282 [2019-09-08 12:02:33,477 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:33,478 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 12:02:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2019-09-08 12:02:33,538 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 86 [2019-09-08 12:02:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:33,539 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2019-09-08 12:02:33,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2019-09-08 12:02:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:33,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:33,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:33,541 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1332810989, now seen corresponding path program 1 times [2019-09-08 12:02:33,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:33,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 12:02:33,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:33,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:33,739 INFO L87 Difference]: Start difference. First operand 590 states and 762 transitions. Second operand 9 states. [2019-09-08 12:02:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:35,253 INFO L93 Difference]: Finished difference Result 1289 states and 1736 transitions. [2019-09-08 12:02:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:35,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:35,258 INFO L225 Difference]: With dead ends: 1289 [2019-09-08 12:02:35,258 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:35,258 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 12:02:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 760 transitions. [2019-09-08 12:02:35,305 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 760 transitions. Word has length 87 [2019-09-08 12:02:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:35,305 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 760 transitions. [2019-09-08 12:02:35,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 760 transitions. [2019-09-08 12:02:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:35,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:35,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:35,308 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash 478571315, now seen corresponding path program 1 times [2019-09-08 12:02:35,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:35,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:35,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:35,476 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 12:02:35,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:35,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:35,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:35,478 INFO L87 Difference]: Start difference. First operand 590 states and 760 transitions. Second operand 9 states. [2019-09-08 12:02:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:36,780 INFO L93 Difference]: Finished difference Result 1330 states and 1797 transitions. [2019-09-08 12:02:36,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:36,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:36,787 INFO L225 Difference]: With dead ends: 1330 [2019-09-08 12:02:36,788 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:02:36,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:02:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-08 12:02:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions. [2019-09-08 12:02:36,861 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 87 [2019-09-08 12:02:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:36,861 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 758 transitions. [2019-09-08 12:02:36,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions. [2019-09-08 12:02:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:36,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:36,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:36,863 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2101826515, now seen corresponding path program 1 times [2019-09-08 12:02:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:36,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:37,069 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 12:02:37,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:37,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:37,071 INFO L87 Difference]: Start difference. First operand 590 states and 758 transitions. Second operand 9 states. [2019-09-08 12:02:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:38,968 INFO L93 Difference]: Finished difference Result 1400 states and 1888 transitions. [2019-09-08 12:02:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:38,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:38,973 INFO L225 Difference]: With dead ends: 1400 [2019-09-08 12:02:38,973 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 12:02:38,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 12:02:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 590. [2019-09-08 12:02:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 756 transitions. [2019-09-08 12:02:39,026 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 756 transitions. Word has length 87 [2019-09-08 12:02:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:39,026 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 756 transitions. [2019-09-08 12:02:39,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 756 transitions. [2019-09-08 12:02:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:39,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:39,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:39,029 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 244970323, now seen corresponding path program 1 times [2019-09-08 12:02:39,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:39,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:39,194 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 12:02:39,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:39,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:39,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:39,197 INFO L87 Difference]: Start difference. First operand 590 states and 756 transitions. Second operand 9 states. [2019-09-08 12:02:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:40,636 INFO L93 Difference]: Finished difference Result 1194 states and 1590 transitions. [2019-09-08 12:02:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:40,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:40,641 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 12:02:40,641 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:02:40,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:02:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-08 12:02:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 754 transitions. [2019-09-08 12:02:40,723 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 754 transitions. Word has length 87 [2019-09-08 12:02:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:40,723 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 754 transitions. [2019-09-08 12:02:40,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 754 transitions. [2019-09-08 12:02:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:40,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:40,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:40,726 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1093485491, now seen corresponding path program 1 times [2019-09-08 12:02:40,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:40,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:40,914 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 12:02:40,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:40,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:40,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:40,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:40,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:40,916 INFO L87 Difference]: Start difference. First operand 590 states and 754 transitions. Second operand 9 states. [2019-09-08 12:02:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:42,427 INFO L93 Difference]: Finished difference Result 1157 states and 1532 transitions. [2019-09-08 12:02:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:42,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:42,433 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:02:42,433 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:42,434 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 12:02:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 752 transitions. [2019-09-08 12:02:42,497 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 752 transitions. Word has length 87 [2019-09-08 12:02:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:42,497 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 752 transitions. [2019-09-08 12:02:42,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 752 transitions. [2019-09-08 12:02:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:42,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:42,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:42,499 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1482555949, now seen corresponding path program 1 times [2019-09-08 12:02:42,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:42,671 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 12:02:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:42,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:42,673 INFO L87 Difference]: Start difference. First operand 590 states and 752 transitions. Second operand 9 states. [2019-09-08 12:02:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:44,225 INFO L93 Difference]: Finished difference Result 1157 states and 1530 transitions. [2019-09-08 12:02:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:44,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:44,229 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:02:44,229 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:44,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 750 transitions. [2019-09-08 12:02:44,306 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 750 transitions. Word has length 87 [2019-09-08 12:02:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:44,306 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 750 transitions. [2019-09-08 12:02:44,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 750 transitions. [2019-09-08 12:02:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:44,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:44,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:44,307 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1339772467, now seen corresponding path program 1 times [2019-09-08 12:02:44,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:44,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:44,473 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 12:02:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:44,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:44,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:44,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:44,475 INFO L87 Difference]: Start difference. First operand 590 states and 750 transitions. Second operand 9 states. [2019-09-08 12:02:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:45,974 INFO L93 Difference]: Finished difference Result 1285 states and 1717 transitions. [2019-09-08 12:02:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:45,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:45,977 INFO L225 Difference]: With dead ends: 1285 [2019-09-08 12:02:45,977 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:45,978 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 12:02:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-09-08 12:02:46,034 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 749 transitions. Word has length 87 [2019-09-08 12:02:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:46,035 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-09-08 12:02:46,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 749 transitions. [2019-09-08 12:02:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:46,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:46,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:46,036 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2086137837, now seen corresponding path program 1 times [2019-09-08 12:02:46,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:46,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:46,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:46,190 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 12:02:46,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:46,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:46,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:46,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:46,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:46,191 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. Second operand 9 states. [2019-09-08 12:02:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:47,675 INFO L93 Difference]: Finished difference Result 1322 states and 1769 transitions. [2019-09-08 12:02:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:47,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:47,677 INFO L225 Difference]: With dead ends: 1322 [2019-09-08 12:02:47,677 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:02:47,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:02:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-08 12:02:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 748 transitions. [2019-09-08 12:02:47,760 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 748 transitions. Word has length 87 [2019-09-08 12:02:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:47,761 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 748 transitions. [2019-09-08 12:02:47,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 748 transitions. [2019-09-08 12:02:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:47,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:47,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:47,762 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 923787283, now seen corresponding path program 1 times [2019-09-08 12:02:47,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:47,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:47,918 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 12:02:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:47,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:47,920 INFO L87 Difference]: Start difference. First operand 590 states and 748 transitions. Second operand 9 states. [2019-09-08 12:02:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:49,516 INFO L93 Difference]: Finished difference Result 1285 states and 1715 transitions. [2019-09-08 12:02:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:49,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:49,518 INFO L225 Difference]: With dead ends: 1285 [2019-09-08 12:02:49,519 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:49,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 747 transitions. [2019-09-08 12:02:49,609 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 747 transitions. Word has length 87 [2019-09-08 12:02:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 747 transitions. [2019-09-08 12:02:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 747 transitions. [2019-09-08 12:02:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:02:49,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:49,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:49,611 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1851798797, now seen corresponding path program 1 times [2019-09-08 12:02:49,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:49,766 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 12:02:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:49,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:02:49,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:02:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:02:49,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:02:49,768 INFO L87 Difference]: Start difference. First operand 590 states and 747 transitions. Second operand 9 states. [2019-09-08 12:02:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:51,361 INFO L93 Difference]: Finished difference Result 1157 states and 1522 transitions. [2019-09-08 12:02:51,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:02:51,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:02:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:51,364 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:02:51,365 INFO L226 Difference]: Without dead ends: 1151 [2019-09-08 12:02:51,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-08 12:02:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-08 12:02:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:02:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 746 transitions. [2019-09-08 12:02:51,424 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 746 transitions. Word has length 87 [2019-09-08 12:02:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:51,424 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 746 transitions. [2019-09-08 12:02:51,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:02:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 746 transitions. [2019-09-08 12:02:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:02:51,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:51,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:51,426 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2120002391, now seen corresponding path program 1 times [2019-09-08 12:02:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:52,697 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 12:02:52,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:52,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:02:52,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:02:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:02:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:02:52,698 INFO L87 Difference]: Start difference. First operand 590 states and 746 transitions. Second operand 21 states. [2019-09-08 12:02:53,635 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:02:53,874 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-08 12:02:54,053 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:02:54,218 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:02:54,440 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:02:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:57,767 INFO L93 Difference]: Finished difference Result 1160 states and 1548 transitions. [2019-09-08 12:02:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:02:57,768 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2019-09-08 12:02:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:57,770 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:02:57,770 INFO L226 Difference]: Without dead ends: 1031 [2019-09-08 12:02:57,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:02:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-09-08 12:02:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 605. [2019-09-08 12:02:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 12:02:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 766 transitions. [2019-09-08 12:02:57,883 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 766 transitions. Word has length 88 [2019-09-08 12:02:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:57,884 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 766 transitions. [2019-09-08 12:02:57,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:02:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 766 transitions. [2019-09-08 12:02:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:02:57,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:57,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:57,886 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 81782089, now seen corresponding path program 1 times [2019-09-08 12:02:57,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:57,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:57,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:58,688 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 12:02:58,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:02:58,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:02:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:02:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:02:58,690 INFO L87 Difference]: Start difference. First operand 605 states and 766 transitions. Second operand 17 states. [2019-09-08 12:02:59,264 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:03:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:00,418 INFO L93 Difference]: Finished difference Result 1054 states and 1391 transitions. [2019-09-08 12:03:00,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:03:00,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-08 12:03:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:00,426 INFO L225 Difference]: With dead ends: 1054 [2019-09-08 12:03:00,426 INFO L226 Difference]: Without dead ends: 828 [2019-09-08 12:03:00,427 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 12:03:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-09-08 12:03:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 558. [2019-09-08 12:03:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 12:03:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 704 transitions. [2019-09-08 12:03:00,536 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 704 transitions. Word has length 88 [2019-09-08 12:03:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:00,537 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 704 transitions. [2019-09-08 12:03:00,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:03:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 704 transitions. [2019-09-08 12:03:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:03:00,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:00,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:00,539 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 384754761, now seen corresponding path program 1 times [2019-09-08 12:03:00,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:00,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:00,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:01,537 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 12:03:01,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:01,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:03:01,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:03:01,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:03:01,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:03:01,538 INFO L87 Difference]: Start difference. First operand 558 states and 704 transitions. Second operand 20 states. [2019-09-08 12:03:02,354 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:03:02,561 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-08 12:03:02,724 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:03:02,873 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:03:03,018 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:03:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:05,181 INFO L93 Difference]: Finished difference Result 1035 states and 1353 transitions. [2019-09-08 12:03:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:03:05,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2019-09-08 12:03:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:05,184 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 12:03:05,184 INFO L226 Difference]: Without dead ends: 841 [2019-09-08 12:03:05,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:03:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-08 12:03:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 565. [2019-09-08 12:03:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-08 12:03:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 711 transitions. [2019-09-08 12:03:05,307 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 711 transitions. Word has length 88 [2019-09-08 12:03:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:05,307 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 711 transitions. [2019-09-08 12:03:05,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:03:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 711 transitions. [2019-09-08 12:03:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:03:05,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:05,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:05,309 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -566170359, now seen corresponding path program 1 times [2019-09-08 12:03:05,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:05,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:06,521 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 12:03:06,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:06,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:03:06,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:03:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:03:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:03:06,522 INFO L87 Difference]: Start difference. First operand 565 states and 711 transitions. Second operand 22 states. [2019-09-08 12:03:07,574 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:03:07,813 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 12:03:08,184 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 12:03:08,332 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:03:08,535 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:03:08,726 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:03:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:12,092 INFO L93 Difference]: Finished difference Result 1198 states and 1576 transitions. [2019-09-08 12:03:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:03:12,092 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-08 12:03:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:12,098 INFO L225 Difference]: With dead ends: 1198 [2019-09-08 12:03:12,098 INFO L226 Difference]: Without dead ends: 1066 [2019-09-08 12:03:12,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:03:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-08 12:03:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 572. [2019-09-08 12:03:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-08 12:03:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 718 transitions. [2019-09-08 12:03:12,248 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 718 transitions. Word has length 88 [2019-09-08 12:03:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:12,248 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 718 transitions. [2019-09-08 12:03:12,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:03:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 718 transitions. [2019-09-08 12:03:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:03:12,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:12,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:12,251 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1156320813, now seen corresponding path program 1 times [2019-09-08 12:03:12,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:13,002 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 12:03:13,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:13,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:03:13,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:03:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:03:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:03:13,003 INFO L87 Difference]: Start difference. First operand 572 states and 718 transitions. Second operand 17 states. [2019-09-08 12:03:13,582 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:03:13,724 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:03:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:16,139 INFO L93 Difference]: Finished difference Result 1296 states and 1727 transitions. [2019-09-08 12:03:16,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:03:16,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-08 12:03:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:16,145 INFO L225 Difference]: With dead ends: 1296 [2019-09-08 12:03:16,145 INFO L226 Difference]: Without dead ends: 1166 [2019-09-08 12:03:16,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:03:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-08 12:03:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 572. [2019-09-08 12:03:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-08 12:03:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 716 transitions. [2019-09-08 12:03:16,346 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 716 transitions. Word has length 88 [2019-09-08 12:03:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:16,347 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 716 transitions. [2019-09-08 12:03:16,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:03:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 716 transitions. [2019-09-08 12:03:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:03:16,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:16,349 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1020462135, now seen corresponding path program 1 times [2019-09-08 12:03:16,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:16,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:16,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:16,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:17,183 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 12:03:17,332 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 12:03:17,895 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 12:03:17,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:17,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:03:17,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:03:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:03:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:03:17,896 INFO L87 Difference]: Start difference. First operand 572 states and 716 transitions. Second operand 22 states. [2019-09-08 12:03:18,843 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 12:03:19,093 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:03:19,363 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 12:03:19,524 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:03:19,713 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-08 12:03:19,882 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 12:03:20,012 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:03:20,172 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:03:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:22,143 INFO L93 Difference]: Finished difference Result 977 states and 1287 transitions. [2019-09-08 12:03:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:03:22,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-08 12:03:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:22,146 INFO L225 Difference]: With dead ends: 977 [2019-09-08 12:03:22,146 INFO L226 Difference]: Without dead ends: 826 [2019-09-08 12:03:22,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:03:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-09-08 12:03:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 579. [2019-09-08 12:03:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:03:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 723 transitions. [2019-09-08 12:03:22,274 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 723 transitions. Word has length 88 [2019-09-08 12:03:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:22,274 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 723 transitions. [2019-09-08 12:03:22,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:03:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 723 transitions. [2019-09-08 12:03:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:22,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:22,276 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:22,276 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1790204216, now seen corresponding path program 1 times [2019-09-08 12:03:22,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:22,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:23,088 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:03:23,226 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:03:24,129 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 12:03:24,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:24,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:03:24,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:03:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:03:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:03:24,131 INFO L87 Difference]: Start difference. First operand 579 states and 723 transitions. Second operand 26 states. [2019-09-08 12:03:24,286 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 12:03:25,336 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:03:25,570 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-08 12:03:25,869 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-08 12:03:26,247 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-08 12:03:26,469 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:03:26,704 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:03:26,970 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 12:03:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:30,699 INFO L93 Difference]: Finished difference Result 905 states and 1157 transitions. [2019-09-08 12:03:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:03:30,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-09-08 12:03:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:30,706 INFO L225 Difference]: With dead ends: 905 [2019-09-08 12:03:30,707 INFO L226 Difference]: Without dead ends: 773 [2019-09-08 12:03:30,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:03:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-08 12:03:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 590. [2019-09-08 12:03:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 12:03:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 739 transitions. [2019-09-08 12:03:30,882 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 739 transitions. Word has length 89 [2019-09-08 12:03:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:30,884 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 739 transitions. [2019-09-08 12:03:30,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:03:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 739 transitions. [2019-09-08 12:03:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:30,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:30,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:30,887 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash -363234600, now seen corresponding path program 1 times [2019-09-08 12:03:30,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:30,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:31,609 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 12:03:31,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:31,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:03:31,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:03:31,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:03:31,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:03:31,610 INFO L87 Difference]: Start difference. First operand 590 states and 739 transitions. Second operand 17 states. [2019-09-08 12:03:32,227 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:03:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:34,198 INFO L93 Difference]: Finished difference Result 1306 states and 1743 transitions. [2019-09-08 12:03:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:03:34,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-08 12:03:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:34,200 INFO L225 Difference]: With dead ends: 1306 [2019-09-08 12:03:34,200 INFO L226 Difference]: Without dead ends: 1123 [2019-09-08 12:03:34,200 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 12:03:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-09-08 12:03:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 559. [2019-09-08 12:03:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-08 12:03:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 695 transitions. [2019-09-08 12:03:34,297 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 695 transitions. Word has length 89 [2019-09-08 12:03:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:34,297 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 695 transitions. [2019-09-08 12:03:34,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:03:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 695 transitions. [2019-09-08 12:03:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:34,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:34,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:34,299 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash -138543399, now seen corresponding path program 1 times [2019-09-08 12:03:34,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:34,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:34,651 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 12:03:34,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:34,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:03:34,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:03:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:03:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:03:34,653 INFO L87 Difference]: Start difference. First operand 559 states and 695 transitions. Second operand 11 states. [2019-09-08 12:03:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:35,530 INFO L93 Difference]: Finished difference Result 1090 states and 1437 transitions. [2019-09-08 12:03:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:03:35,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:03:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:35,532 INFO L225 Difference]: With dead ends: 1090 [2019-09-08 12:03:35,532 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 12:03:35,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:03:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 12:03:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 531. [2019-09-08 12:03:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 12:03:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 661 transitions. [2019-09-08 12:03:35,635 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 661 transitions. Word has length 89 [2019-09-08 12:03:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:35,635 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 661 transitions. [2019-09-08 12:03:35,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:03:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 661 transitions. [2019-09-08 12:03:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:35,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:35,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:35,637 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -303870206, now seen corresponding path program 1 times [2019-09-08 12:03:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:36,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 12:03:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:03:36,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:03:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:03:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:03:36,028 INFO L87 Difference]: Start difference. First operand 531 states and 661 transitions. Second operand 11 states. [2019-09-08 12:03:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:37,457 INFO L93 Difference]: Finished difference Result 1838 states and 2552 transitions. [2019-09-08 12:03:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:03:37,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:03:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:37,460 INFO L225 Difference]: With dead ends: 1838 [2019-09-08 12:03:37,460 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:03:37,461 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 12:03:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:03:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 519. [2019-09-08 12:03:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-08 12:03:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 646 transitions. [2019-09-08 12:03:37,571 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 646 transitions. Word has length 89 [2019-09-08 12:03:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:37,572 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 646 transitions. [2019-09-08 12:03:37,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:03:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 646 transitions. [2019-09-08 12:03:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:37,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:37,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:37,574 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash -957518029, now seen corresponding path program 1 times [2019-09-08 12:03:37,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:37,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:37,896 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-09-08 12:03:38,051 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-09-08 12:03:38,263 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 12:03:38,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:38,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:03:38,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:03:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:03:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:03:38,266 INFO L87 Difference]: Start difference. First operand 519 states and 646 transitions. Second operand 14 states. [2019-09-08 12:03:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:40,375 INFO L93 Difference]: Finished difference Result 1058 states and 1381 transitions. [2019-09-08 12:03:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:03:40,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-08 12:03:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:40,377 INFO L225 Difference]: With dead ends: 1058 [2019-09-08 12:03:40,377 INFO L226 Difference]: Without dead ends: 918 [2019-09-08 12:03:40,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:03:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-08 12:03:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 511. [2019-09-08 12:03:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-08 12:03:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 635 transitions. [2019-09-08 12:03:40,563 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 635 transitions. Word has length 89 [2019-09-08 12:03:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:40,564 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 635 transitions. [2019-09-08 12:03:40,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:03:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 635 transitions. [2019-09-08 12:03:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:40,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:40,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:40,565 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1065628564, now seen corresponding path program 1 times [2019-09-08 12:03:40,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:40,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:40,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:40,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:40,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:41,288 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 12:03:41,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:41,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:03:41,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:03:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:03:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:03:41,295 INFO L87 Difference]: Start difference. First operand 511 states and 635 transitions. Second operand 14 states. [2019-09-08 12:03:41,927 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-08 12:03:42,144 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-08 12:03:42,335 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:03:42,475 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:03:42,741 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:03:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:44,083 INFO L93 Difference]: Finished difference Result 918 states and 1176 transitions. [2019-09-08 12:03:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:03:44,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-08 12:03:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:44,085 INFO L225 Difference]: With dead ends: 918 [2019-09-08 12:03:44,085 INFO L226 Difference]: Without dead ends: 784 [2019-09-08 12:03:44,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:03:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-08 12:03:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 505. [2019-09-08 12:03:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:03:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 628 transitions. [2019-09-08 12:03:44,219 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 628 transitions. Word has length 89 [2019-09-08 12:03:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:44,219 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 628 transitions. [2019-09-08 12:03:44,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:03:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 628 transitions. [2019-09-08 12:03:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:44,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:44,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:44,220 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash 841334007, now seen corresponding path program 1 times [2019-09-08 12:03:44,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:44,738 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 12:03:44,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:44,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:03:44,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:03:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:03:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:03:44,740 INFO L87 Difference]: Start difference. First operand 505 states and 628 transitions. Second operand 12 states. [2019-09-08 12:03:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:45,680 INFO L93 Difference]: Finished difference Result 1046 states and 1418 transitions. [2019-09-08 12:03:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:03:45,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-08 12:03:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:45,682 INFO L225 Difference]: With dead ends: 1046 [2019-09-08 12:03:45,682 INFO L226 Difference]: Without dead ends: 863 [2019-09-08 12:03:45,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:03:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-08 12:03:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 450. [2019-09-08 12:03:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:03:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 565 transitions. [2019-09-08 12:03:45,783 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 565 transitions. Word has length 89 [2019-09-08 12:03:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:45,783 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 565 transitions. [2019-09-08 12:03:45,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:03:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 565 transitions. [2019-09-08 12:03:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:03:45,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:45,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:45,784 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2096385733, now seen corresponding path program 1 times [2019-09-08 12:03:45,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:45,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:45,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:46,437 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 12:03:46,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:46,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:03:46,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:03:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:03:46,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:03:46,439 INFO L87 Difference]: Start difference. First operand 450 states and 565 transitions. Second operand 16 states. [2019-09-08 12:03:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:48,792 INFO L93 Difference]: Finished difference Result 1148 states and 1575 transitions. [2019-09-08 12:03:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:03:48,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-08 12:03:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:48,795 INFO L225 Difference]: With dead ends: 1148 [2019-09-08 12:03:48,795 INFO L226 Difference]: Without dead ends: 993 [2019-09-08 12:03:48,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:03:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-08 12:03:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 422. [2019-09-08 12:03:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-08 12:03:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 530 transitions. [2019-09-08 12:03:48,916 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 530 transitions. Word has length 89 [2019-09-08 12:03:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:48,916 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 530 transitions. [2019-09-08 12:03:48,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:03:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 530 transitions. [2019-09-08 12:03:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:03:48,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:48,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:48,918 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2061266405, now seen corresponding path program 1 times [2019-09-08 12:03:48,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:48,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:48,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:48,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:49,249 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 12:03:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:49,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:03:49,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:03:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:03:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:03:49,251 INFO L87 Difference]: Start difference. First operand 422 states and 530 transitions. Second operand 11 states. [2019-09-08 12:03:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:50,785 INFO L93 Difference]: Finished difference Result 1723 states and 2413 transitions. [2019-09-08 12:03:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:03:50,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-08 12:03:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:50,787 INFO L225 Difference]: With dead ends: 1723 [2019-09-08 12:03:50,787 INFO L226 Difference]: Without dead ends: 1568 [2019-09-08 12:03:50,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:03:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-09-08 12:03:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 382. [2019-09-08 12:03:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-08 12:03:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 476 transitions. [2019-09-08 12:03:50,901 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 476 transitions. Word has length 90 [2019-09-08 12:03:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:50,901 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 476 transitions. [2019-09-08 12:03:50,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:03:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 476 transitions. [2019-09-08 12:03:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:03:50,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:50,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:50,902 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1853534946, now seen corresponding path program 1 times [2019-09-08 12:03:50,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:50,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:50,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:51,380 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 12:03:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:51,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:03:51,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:03:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:03:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:03:51,381 INFO L87 Difference]: Start difference. First operand 382 states and 476 transitions. Second operand 12 states. [2019-09-08 12:03:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:52,976 INFO L93 Difference]: Finished difference Result 1342 states and 1842 transitions. [2019-09-08 12:03:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:03:52,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 12:03:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:52,979 INFO L225 Difference]: With dead ends: 1342 [2019-09-08 12:03:52,979 INFO L226 Difference]: Without dead ends: 1177 [2019-09-08 12:03:52,980 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 12:03:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-09-08 12:03:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 345. [2019-09-08 12:03:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 12:03:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 431 transitions. [2019-09-08 12:03:53,109 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 431 transitions. Word has length 90 [2019-09-08 12:03:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:53,109 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 431 transitions. [2019-09-08 12:03:53,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:03:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 431 transitions. [2019-09-08 12:03:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:03:53,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:53,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:53,110 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1759645528, now seen corresponding path program 1 times [2019-09-08 12:03:53,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:53,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:53,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:53,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:03:53,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:53,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:03:53,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:03:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:03:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:03:53,943 INFO L87 Difference]: Start difference. First operand 345 states and 431 transitions. Second operand 16 states. [2019-09-08 12:03:54,558 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:03:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:55,903 INFO L93 Difference]: Finished difference Result 612 states and 770 transitions. [2019-09-08 12:03:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:03:55,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-08 12:03:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:55,904 INFO L225 Difference]: With dead ends: 612 [2019-09-08 12:03:55,904 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 12:03:55,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:03:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 12:03:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 363. [2019-09-08 12:03:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-08 12:03:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 452 transitions. [2019-09-08 12:03:56,027 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 452 transitions. Word has length 90 [2019-09-08 12:03:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:56,027 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 452 transitions. [2019-09-08 12:03:56,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:03:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 452 transitions. [2019-09-08 12:03:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:03:56,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:56,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:56,028 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash -576618081, now seen corresponding path program 1 times [2019-09-08 12:03:56,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:56,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:56,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:56,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:56,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:56,649 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 12:03:56,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:56,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:03:56,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:03:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:03:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:03:56,650 INFO L87 Difference]: Start difference. First operand 363 states and 452 transitions. Second operand 15 states. [2019-09-08 12:03:57,161 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2019-09-08 12:03:57,294 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:03:57,425 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:03:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:58,256 INFO L93 Difference]: Finished difference Result 721 states and 966 transitions. [2019-09-08 12:03:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:03:58,257 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-08 12:03:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:58,258 INFO L225 Difference]: With dead ends: 721 [2019-09-08 12:03:58,258 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 12:03:58,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:03:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 12:03:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 357. [2019-09-08 12:03:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-08 12:03:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 445 transitions. [2019-09-08 12:03:58,378 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 445 transitions. Word has length 90 [2019-09-08 12:03:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:58,379 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 445 transitions. [2019-09-08 12:03:58,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:03:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 445 transitions. [2019-09-08 12:03:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:03:58,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:58,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:58,379 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1327171516, now seen corresponding path program 1 times [2019-09-08 12:03:58,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:58,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:58,931 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 12:03:58,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:03:58,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:03:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:03:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:03:58,932 INFO L87 Difference]: Start difference. First operand 357 states and 445 transitions. Second operand 12 states. [2019-09-08 12:03:59,356 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-08 12:04:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:00,179 INFO L93 Difference]: Finished difference Result 710 states and 930 transitions. [2019-09-08 12:04:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:00,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 12:04:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:00,180 INFO L225 Difference]: With dead ends: 710 [2019-09-08 12:04:00,180 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 12:04:00,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:04:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 12:04:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 353. [2019-09-08 12:04:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-08 12:04:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 440 transitions. [2019-09-08 12:04:00,343 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 440 transitions. Word has length 90 [2019-09-08 12:04:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:00,343 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 440 transitions. [2019-09-08 12:04:00,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:04:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 440 transitions. [2019-09-08 12:04:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:04:00,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:00,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:00,344 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash -863961032, now seen corresponding path program 1 times [2019-09-08 12:04:00,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:00,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:00,499 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 12:04:00,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:00,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:00,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:00,501 INFO L87 Difference]: Start difference. First operand 353 states and 440 transitions. Second operand 9 states. [2019-09-08 12:04:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:01,423 INFO L93 Difference]: Finished difference Result 720 states and 947 transitions. [2019-09-08 12:04:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:01,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-08 12:04:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:01,424 INFO L225 Difference]: With dead ends: 720 [2019-09-08 12:04:01,424 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 12:04:01,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:04:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 12:04:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 353. [2019-09-08 12:04:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-08 12:04:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 438 transitions. [2019-09-08 12:04:01,534 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 438 transitions. Word has length 91 [2019-09-08 12:04:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:01,535 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 438 transitions. [2019-09-08 12:04:01,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 438 transitions. [2019-09-08 12:04:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:04:01,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:01,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:01,536 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2010479467, now seen corresponding path program 1 times [2019-09-08 12:04:01,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:01,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:02,126 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 12:04:02,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:02,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:04:02,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:04:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:04:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:04:02,127 INFO L87 Difference]: Start difference. First operand 353 states and 438 transitions. Second operand 13 states. [2019-09-08 12:04:02,603 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 12:04:02,744 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 12:04:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:03,352 INFO L93 Difference]: Finished difference Result 673 states and 891 transitions. [2019-09-08 12:04:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:03,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-08 12:04:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:03,355 INFO L225 Difference]: With dead ends: 673 [2019-09-08 12:04:03,355 INFO L226 Difference]: Without dead ends: 624 [2019-09-08 12:04:03,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:04:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-08 12:04:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 304. [2019-09-08 12:04:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:04:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 382 transitions. [2019-09-08 12:04:03,478 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 382 transitions. Word has length 91 [2019-09-08 12:04:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:03,479 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 382 transitions. [2019-09-08 12:04:03,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:04:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 382 transitions. [2019-09-08 12:04:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:04:03,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:03,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:03,480 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash -767603588, now seen corresponding path program 1 times [2019-09-08 12:04:03,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:03,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:03,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:03,647 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 12:04:03,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:03,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:03,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:03,651 INFO L87 Difference]: Start difference. First operand 304 states and 382 transitions. Second operand 9 states. [2019-09-08 12:04:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:04,466 INFO L93 Difference]: Finished difference Result 496 states and 641 transitions. [2019-09-08 12:04:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:04:04,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 12:04:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:04,467 INFO L225 Difference]: With dead ends: 496 [2019-09-08 12:04:04,468 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 12:04:04,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:04:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 12:04:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 304. [2019-09-08 12:04:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:04:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 381 transitions. [2019-09-08 12:04:04,566 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 381 transitions. Word has length 92 [2019-09-08 12:04:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:04,567 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 381 transitions. [2019-09-08 12:04:04,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 381 transitions. [2019-09-08 12:04:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:04:04,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:04,567 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] [2019-09-08 12:04:04,567 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1562795773, now seen corresponding path program 1 times [2019-09-08 12:04:04,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:04,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:06,073 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 12:04:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:06,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:04:06,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:04:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:04:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:04:06,075 INFO L87 Difference]: Start difference. First operand 304 states and 381 transitions. Second operand 26 states. [2019-09-08 12:04:07,175 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:04:07,347 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:04:07,595 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:04:07,770 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:04:07,949 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:04:08,257 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:04:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:11,452 INFO L93 Difference]: Finished difference Result 1089 states and 1489 transitions. [2019-09-08 12:04:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:04:11,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-09-08 12:04:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:11,454 INFO L225 Difference]: With dead ends: 1089 [2019-09-08 12:04:11,454 INFO L226 Difference]: Without dead ends: 1083 [2019-09-08 12:04:11,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=399, Invalid=1953, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:04:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-09-08 12:04:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 324. [2019-09-08 12:04:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-08 12:04:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 405 transitions. [2019-09-08 12:04:11,562 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 405 transitions. Word has length 93 [2019-09-08 12:04:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:11,562 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 405 transitions. [2019-09-08 12:04:11,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:04:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 405 transitions. [2019-09-08 12:04:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:04:11,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:11,563 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] [2019-09-08 12:04:11,563 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:11,564 INFO L82 PathProgramCache]: Analyzing trace with hash -910660000, now seen corresponding path program 1 times [2019-09-08 12:04:11,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:11,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:11,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:12,690 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 12:04:12,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:12,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:04:12,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:04:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:04:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:12,691 INFO L87 Difference]: Start difference. First operand 324 states and 405 transitions. Second operand 21 states. [2019-09-08 12:04:13,582 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:04:13,845 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-08 12:04:14,015 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:04:14,182 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:04:14,377 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 12:04:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:15,550 INFO L93 Difference]: Finished difference Result 639 states and 847 transitions. [2019-09-08 12:04:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:04:15,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 94 [2019-09-08 12:04:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:15,551 INFO L225 Difference]: With dead ends: 639 [2019-09-08 12:04:15,551 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 12:04:15,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:04:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 12:04:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 325. [2019-09-08 12:04:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-08 12:04:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 406 transitions. [2019-09-08 12:04:15,658 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 406 transitions. Word has length 94 [2019-09-08 12:04:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:15,659 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 406 transitions. [2019-09-08 12:04:15,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:04:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 406 transitions. [2019-09-08 12:04:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:04:15,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:15,659 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] [2019-09-08 12:04:15,660 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash -959528058, now seen corresponding path program 1 times [2019-09-08 12:04:15,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:15,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:15,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:15,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:16,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:16,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:04:16,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:04:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:04:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:04:16,350 INFO L87 Difference]: Start difference. First operand 325 states and 406 transitions. Second operand 16 states. [2019-09-08 12:04:16,969 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:04:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:18,916 INFO L93 Difference]: Finished difference Result 1059 states and 1456 transitions. [2019-09-08 12:04:18,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:04:18,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-09-08 12:04:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:18,917 INFO L225 Difference]: With dead ends: 1059 [2019-09-08 12:04:18,917 INFO L226 Difference]: Without dead ends: 1053 [2019-09-08 12:04:18,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:04:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-08 12:04:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 304. [2019-09-08 12:04:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 12:04:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 380 transitions. [2019-09-08 12:04:19,022 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 380 transitions. Word has length 94 [2019-09-08 12:04:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:19,023 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 380 transitions. [2019-09-08 12:04:19,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:04:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 380 transitions. [2019-09-08 12:04:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:04:19,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:19,024 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] [2019-09-08 12:04:19,024 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash -333235878, now seen corresponding path program 1 times [2019-09-08 12:04:19,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:19,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:19,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:19,444 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 12:04:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:04:19,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:04:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:04:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:04:19,445 INFO L87 Difference]: Start difference. First operand 304 states and 380 transitions. Second operand 12 states. [2019-09-08 12:04:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:20,805 INFO L93 Difference]: Finished difference Result 766 states and 1033 transitions. [2019-09-08 12:04:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:04:20,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-08 12:04:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:20,807 INFO L225 Difference]: With dead ends: 766 [2019-09-08 12:04:20,807 INFO L226 Difference]: Without dead ends: 760 [2019-09-08 12:04:20,807 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 12:04:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-08 12:04:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 298. [2019-09-08 12:04:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 12:04:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 374 transitions. [2019-09-08 12:04:20,912 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 374 transitions. Word has length 94 [2019-09-08 12:04:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:20,912 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 374 transitions. [2019-09-08 12:04:20,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:04:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 374 transitions. [2019-09-08 12:04:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:04:20,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:20,913 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] [2019-09-08 12:04:20,913 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:20,913 INFO L82 PathProgramCache]: Analyzing trace with hash -442414623, now seen corresponding path program 1 times [2019-09-08 12:04:20,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:20,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:20,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:22,842 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 12:04:22,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:22,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:04:22,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:04:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:04:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:04:22,843 INFO L87 Difference]: Start difference. First operand 298 states and 374 transitions. Second operand 28 states. [2019-09-08 12:04:23,109 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:04:23,803 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:04:23,983 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 12:04:24,231 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:04:24,544 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:04:24,799 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:04:25,092 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-08 12:04:25,424 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-08 12:04:25,698 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:04:25,970 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:04:26,259 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:04:26,572 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-08 12:04:26,801 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:04:27,036 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:04:27,324 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:04:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:28,801 INFO L93 Difference]: Finished difference Result 371 states and 446 transitions. [2019-09-08 12:04:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:04:28,802 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-08 12:04:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:28,803 INFO L225 Difference]: With dead ends: 371 [2019-09-08 12:04:28,803 INFO L226 Difference]: Without dead ends: 362 [2019-09-08 12:04:28,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=499, Invalid=2051, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:04:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-08 12:04:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 310. [2019-09-08 12:04:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 12:04:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 387 transitions. [2019-09-08 12:04:28,936 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 387 transitions. Word has length 94 [2019-09-08 12:04:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:28,937 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 387 transitions. [2019-09-08 12:04:28,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:04:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 387 transitions. [2019-09-08 12:04:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:04:28,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:28,938 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 12:04:28,938 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash 596288672, now seen corresponding path program 1 times [2019-09-08 12:04:28,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:28,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:28,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:28,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:29,306 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 12:04:29,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:29,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:29,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:29,307 INFO L87 Difference]: Start difference. First operand 310 states and 387 transitions. Second operand 9 states. [2019-09-08 12:04:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:29,996 INFO L93 Difference]: Finished difference Result 710 states and 973 transitions. [2019-09-08 12:04:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:04:29,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 12:04:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:29,997 INFO L225 Difference]: With dead ends: 710 [2019-09-08 12:04:29,997 INFO L226 Difference]: Without dead ends: 664 [2019-09-08 12:04:29,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:04:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-08 12:04:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 264. [2019-09-08 12:04:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-08 12:04:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 337 transitions. [2019-09-08 12:04:30,098 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 337 transitions. Word has length 95 [2019-09-08 12:04:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:30,098 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 337 transitions. [2019-09-08 12:04:30,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 337 transitions. [2019-09-08 12:04:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:04:30,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:30,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:30,099 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -467440922, now seen corresponding path program 1 times [2019-09-08 12:04:30,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:30,182 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 12:04:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:30,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:30,184 INFO L87 Difference]: Start difference. First operand 264 states and 337 transitions. Second operand 3 states. [2019-09-08 12:04:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:30,378 INFO L93 Difference]: Finished difference Result 512 states and 701 transitions. [2019-09-08 12:04:30,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:30,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:04:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:30,379 INFO L225 Difference]: With dead ends: 512 [2019-09-08 12:04:30,380 INFO L226 Difference]: Without dead ends: 384 [2019-09-08 12:04:30,380 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 12:04:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-08 12:04:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-09-08 12:04:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-08 12:04:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 508 transitions. [2019-09-08 12:04:30,561 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 508 transitions. Word has length 122 [2019-09-08 12:04:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:30,561 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 508 transitions. [2019-09-08 12:04:30,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 508 transitions. [2019-09-08 12:04:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:30,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:30,562 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, 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 12:04:30,562 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1042185839, now seen corresponding path program 1 times [2019-09-08 12:04:30,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:30,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:30,657 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 12:04:30,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:30,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:30,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:30,659 INFO L87 Difference]: Start difference. First operand 382 states and 508 transitions. Second operand 7 states. [2019-09-08 12:04:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:31,511 INFO L93 Difference]: Finished difference Result 1150 states and 1612 transitions. [2019-09-08 12:04:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:04:31,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:04:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:31,513 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 12:04:31,513 INFO L226 Difference]: Without dead ends: 904 [2019-09-08 12:04:31,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:04:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-08 12:04:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 442. [2019-09-08 12:04:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-08 12:04:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 590 transitions. [2019-09-08 12:04:31,740 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 590 transitions. Word has length 124 [2019-09-08 12:04:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:31,740 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 590 transitions. [2019-09-08 12:04:31,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:04:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 590 transitions. [2019-09-08 12:04:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:31,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:31,742 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, 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 12:04:31,742 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash -611885514, now seen corresponding path program 1 times [2019-09-08 12:04:31,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:31,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:31,804 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 12:04:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:31,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:31,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:31,806 INFO L87 Difference]: Start difference. First operand 442 states and 590 transitions. Second operand 3 states. [2019-09-08 12:04:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:32,227 INFO L93 Difference]: Finished difference Result 1022 states and 1420 transitions. [2019-09-08 12:04:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:32,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:04:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:32,228 INFO L225 Difference]: With dead ends: 1022 [2019-09-08 12:04:32,228 INFO L226 Difference]: Without dead ends: 716 [2019-09-08 12:04:32,229 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 12:04:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-08 12:04:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 714. [2019-09-08 12:04:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-08 12:04:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 968 transitions. [2019-09-08 12:04:32,639 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 968 transitions. Word has length 124 [2019-09-08 12:04:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:32,639 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 968 transitions. [2019-09-08 12:04:32,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 968 transitions. [2019-09-08 12:04:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:32,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:32,640 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, 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 12:04:32,640 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -545392002, now seen corresponding path program 1 times [2019-09-08 12:04:32,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:32,710 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 12:04:32,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:04:32,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:04:32,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:04:32,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:04:32,711 INFO L87 Difference]: Start difference. First operand 714 states and 968 transitions. Second operand 3 states. [2019-09-08 12:04:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:33,322 INFO L93 Difference]: Finished difference Result 1590 states and 2208 transitions. [2019-09-08 12:04:33,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:04:33,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:04:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:33,324 INFO L225 Difference]: With dead ends: 1590 [2019-09-08 12:04:33,324 INFO L226 Difference]: Without dead ends: 1012 [2019-09-08 12:04:33,325 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 12:04:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-09-08 12:04:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1010. [2019-09-08 12:04:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-09-08 12:04:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1378 transitions. [2019-09-08 12:04:33,925 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1378 transitions. Word has length 124 [2019-09-08 12:04:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:33,926 INFO L475 AbstractCegarLoop]: Abstraction has 1010 states and 1378 transitions. [2019-09-08 12:04:33,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1378 transitions. [2019-09-08 12:04:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:33,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:33,927 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, 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 12:04:33,927 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash -850819473, now seen corresponding path program 1 times [2019-09-08 12:04:33,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:34,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:34,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:34,027 INFO L87 Difference]: Start difference. First operand 1010 states and 1378 transitions. Second operand 7 states. [2019-09-08 12:04:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:36,616 INFO L93 Difference]: Finished difference Result 4258 states and 5942 transitions. [2019-09-08 12:04:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:04:36,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:04:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:36,619 INFO L225 Difference]: With dead ends: 4258 [2019-09-08 12:04:36,619 INFO L226 Difference]: Without dead ends: 3384 [2019-09-08 12:04:36,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:04:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-09-08 12:04:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2002. [2019-09-08 12:04:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-09-08 12:04:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2776 transitions. [2019-09-08 12:04:37,851 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2776 transitions. Word has length 124 [2019-09-08 12:04:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:37,851 INFO L475 AbstractCegarLoop]: Abstraction has 2002 states and 2776 transitions. [2019-09-08 12:04:37,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:04:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2776 transitions. [2019-09-08 12:04:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:37,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:37,852 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, 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 12:04:37,852 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1444234351, now seen corresponding path program 1 times [2019-09-08 12:04:37,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:37,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:37,949 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 12:04:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:37,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:37,950 INFO L87 Difference]: Start difference. First operand 2002 states and 2776 transitions. Second operand 7 states. [2019-09-08 12:04:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:42,534 INFO L93 Difference]: Finished difference Result 8346 states and 11696 transitions. [2019-09-08 12:04:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:04:42,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:04:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:42,540 INFO L225 Difference]: With dead ends: 8346 [2019-09-08 12:04:42,540 INFO L226 Difference]: Without dead ends: 6480 [2019-09-08 12:04:42,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:04:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-09-08 12:04:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 4106. [2019-09-08 12:04:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-09-08 12:04:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 5740 transitions. [2019-09-08 12:04:45,146 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 5740 transitions. Word has length 124 [2019-09-08 12:04:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:45,147 INFO L475 AbstractCegarLoop]: Abstraction has 4106 states and 5740 transitions. [2019-09-08 12:04:45,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:04:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5740 transitions. [2019-09-08 12:04:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:04:45,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:45,148 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, 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 12:04:45,149 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash -154008977, now seen corresponding path program 1 times [2019-09-08 12:04:45,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:45,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:45,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:45,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:45,246 INFO L87 Difference]: Start difference. First operand 4106 states and 5740 transitions. Second operand 7 states. [2019-09-08 12:04:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:54,851 INFO L93 Difference]: Finished difference Result 18226 states and 25640 transitions. [2019-09-08 12:04:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:04:54,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:04:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:54,865 INFO L225 Difference]: With dead ends: 18226 [2019-09-08 12:04:54,865 INFO L226 Difference]: Without dead ends: 14256 [2019-09-08 12:04:54,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:04:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14256 states. [2019-09-08 12:05:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14256 to 8554. [2019-09-08 12:05:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8554 states. [2019-09-08 12:05:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8554 states to 8554 states and 12004 transitions. [2019-09-08 12:05:00,385 INFO L78 Accepts]: Start accepts. Automaton has 8554 states and 12004 transitions. Word has length 124 [2019-09-08 12:05:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:00,386 INFO L475 AbstractCegarLoop]: Abstraction has 8554 states and 12004 transitions. [2019-09-08 12:05:00,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:05:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 8554 states and 12004 transitions. [2019-09-08 12:05:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:05:00,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:00,388 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, 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 12:05:00,388 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1325383791, now seen corresponding path program 1 times [2019-09-08 12:05:00,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:00,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:00,481 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 12:05:00,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:00,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:05:00,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:05:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:05:00,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:05:00,482 INFO L87 Difference]: Start difference. First operand 8554 states and 12004 transitions. Second operand 7 states. [2019-09-08 12:05:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:16,840 INFO L93 Difference]: Finished difference Result 32786 states and 46194 transitions. [2019-09-08 12:05:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:05:16,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:05:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:16,863 INFO L225 Difference]: With dead ends: 32786 [2019-09-08 12:05:16,864 INFO L226 Difference]: Without dead ends: 24368 [2019-09-08 12:05:16,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:05:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24368 states. [2019-09-08 12:05:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24368 to 14234. [2019-09-08 12:05:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2019-09-08 12:05:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 20012 transitions. [2019-09-08 12:05:25,986 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 20012 transitions. Word has length 124 [2019-09-08 12:05:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:25,986 INFO L475 AbstractCegarLoop]: Abstraction has 14234 states and 20012 transitions. [2019-09-08 12:05:25,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:05:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 20012 transitions. [2019-09-08 12:05:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:05:25,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:25,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:25,989 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1768680915, now seen corresponding path program 1 times [2019-09-08 12:05:25,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:25,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:25,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:25,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:25,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:26,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 12:05:26,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:26,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:05:26,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:05:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:05:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:05:26,055 INFO L87 Difference]: Start difference. First operand 14234 states and 20012 transitions. Second operand 3 states. [2019-09-08 12:05:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:34,626 INFO L93 Difference]: Finished difference Result 27470 states and 38582 transitions. [2019-09-08 12:05:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:05:34,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 12:05:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:34,639 INFO L225 Difference]: With dead ends: 27470 [2019-09-08 12:05:34,639 INFO L226 Difference]: Without dead ends: 13372 [2019-09-08 12:05:34,654 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 12:05:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2019-09-08 12:05:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 10170. [2019-09-08 12:05:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2019-09-08 12:05:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 14110 transitions. [2019-09-08 12:05:41,600 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 14110 transitions. Word has length 125 [2019-09-08 12:05:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:41,600 INFO L475 AbstractCegarLoop]: Abstraction has 10170 states and 14110 transitions. [2019-09-08 12:05:41,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:05:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 14110 transitions. [2019-09-08 12:05:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:05:41,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:41,602 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, 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 12:05:41,602 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 233216673, now seen corresponding path program 1 times [2019-09-08 12:05:41,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:41,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:41,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:41,666 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 12:05:41,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:41,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:05:41,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:05:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:05:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:05:41,667 INFO L87 Difference]: Start difference. First operand 10170 states and 14110 transitions. Second operand 3 states. [2019-09-08 12:05:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:48,203 INFO L93 Difference]: Finished difference Result 19810 states and 27462 transitions. [2019-09-08 12:05:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:05:48,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 12:05:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:48,212 INFO L225 Difference]: With dead ends: 19810 [2019-09-08 12:05:48,212 INFO L226 Difference]: Without dead ends: 9776 [2019-09-08 12:05:48,221 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 12:05:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9776 states. [2019-09-08 12:05:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9776 to 9102. [2019-09-08 12:05:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9102 states. [2019-09-08 12:05:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 12574 transitions. [2019-09-08 12:05:54,335 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 12574 transitions. Word has length 126 [2019-09-08 12:05:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:54,335 INFO L475 AbstractCegarLoop]: Abstraction has 9102 states and 12574 transitions. [2019-09-08 12:05:54,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:05:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 12574 transitions. [2019-09-08 12:05:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:05:54,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:54,337 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, 1, 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 12:05:54,337 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1710481623, now seen corresponding path program 1 times [2019-09-08 12:05:54,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:54,403 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 12:05:54,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:54,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:05:54,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:05:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:05:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:05:54,405 INFO L87 Difference]: Start difference. First operand 9102 states and 12574 transitions. Second operand 3 states. [2019-09-08 12:06:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:00,994 INFO L93 Difference]: Finished difference Result 19006 states and 26320 transitions. [2019-09-08 12:06:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:00,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 12:06:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:01,003 INFO L225 Difference]: With dead ends: 19006 [2019-09-08 12:06:01,004 INFO L226 Difference]: Without dead ends: 10040 [2019-09-08 12:06:01,013 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 12:06:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-09-08 12:06:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 10038. [2019-09-08 12:06:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10038 states. [2019-09-08 12:06:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10038 states to 10038 states and 13808 transitions. [2019-09-08 12:06:07,798 INFO L78 Accepts]: Start accepts. Automaton has 10038 states and 13808 transitions. Word has length 127 [2019-09-08 12:06:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:07,798 INFO L475 AbstractCegarLoop]: Abstraction has 10038 states and 13808 transitions. [2019-09-08 12:06:07,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10038 states and 13808 transitions. [2019-09-08 12:06:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:06:07,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:07,799 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, 1, 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 12:06:07,799 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash -113713814, now seen corresponding path program 1 times [2019-09-08 12:06:07,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:07,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:07,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:07,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:07,901 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 12:06:07,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:07,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:06:07,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:06:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:06:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:06:07,902 INFO L87 Difference]: Start difference. First operand 10038 states and 13808 transitions. Second operand 6 states. [2019-09-08 12:06:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:18,319 INFO L93 Difference]: Finished difference Result 15122 states and 20670 transitions. [2019-09-08 12:06:18,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:06:18,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 12:06:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:18,337 INFO L225 Difference]: With dead ends: 15122 [2019-09-08 12:06:18,337 INFO L226 Difference]: Without dead ends: 15120 [2019-09-08 12:06:18,341 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 12:06:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15120 states. [2019-09-08 12:06:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15120 to 10146. [2019-09-08 12:06:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10146 states. [2019-09-08 12:06:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 13880 transitions. [2019-09-08 12:06:25,294 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 13880 transitions. Word has length 127 [2019-09-08 12:06:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:25,294 INFO L475 AbstractCegarLoop]: Abstraction has 10146 states and 13880 transitions. [2019-09-08 12:06:25,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:06:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 13880 transitions. [2019-09-08 12:06:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:06:25,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:25,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:25,299 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -36770884, now seen corresponding path program 1 times [2019-09-08 12:06:25,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:25,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:25,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:25,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:25,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:25,374 INFO L87 Difference]: Start difference. First operand 10146 states and 13880 transitions. Second operand 3 states. [2019-09-08 12:06:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:36,763 INFO L93 Difference]: Finished difference Result 27058 states and 37198 transitions. [2019-09-08 12:06:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:36,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 12:06:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:36,778 INFO L225 Difference]: With dead ends: 27058 [2019-09-08 12:06:36,779 INFO L226 Difference]: Without dead ends: 17048 [2019-09-08 12:06:36,789 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 12:06:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17048 states. [2019-09-08 12:06:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17048 to 16086. [2019-09-08 12:06:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2019-09-08 12:06:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 22104 transitions. [2019-09-08 12:06:47,753 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 22104 transitions. Word has length 158 [2019-09-08 12:06:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:47,753 INFO L475 AbstractCegarLoop]: Abstraction has 16086 states and 22104 transitions. [2019-09-08 12:06:47,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 22104 transitions. [2019-09-08 12:06:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:06:47,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:47,757 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:47,757 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash 257185900, now seen corresponding path program 1 times [2019-09-08 12:06:47,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:47,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:47,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:47,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:06:47,928 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 12:06:47,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:48,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:06:48,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:06:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:06:48,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:06:48,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:06:48,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:06:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:06:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:06:48,532 INFO L87 Difference]: Start difference. First operand 16086 states and 22104 transitions. Second operand 11 states. [2019-09-08 12:08:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:57,915 INFO L93 Difference]: Finished difference Result 203034 states and 278682 transitions. [2019-09-08 12:08:57,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:08:57,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 12:08:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:58,689 INFO L225 Difference]: With dead ends: 203034 [2019-09-08 12:08:58,689 INFO L226 Difference]: Without dead ends: 187084 [2019-09-08 12:08:58,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:08:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187084 states. [2019-09-08 12:09:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187084 to 42186. [2019-09-08 12:09:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42186 states. [2019-09-08 12:09:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42186 states to 42186 states and 57884 transitions. [2019-09-08 12:09:32,614 INFO L78 Accepts]: Start accepts. Automaton has 42186 states and 57884 transitions. Word has length 159 [2019-09-08 12:09:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:32,614 INFO L475 AbstractCegarLoop]: Abstraction has 42186 states and 57884 transitions. [2019-09-08 12:09:32,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:09:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 42186 states and 57884 transitions. [2019-09-08 12:09:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:09:32,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:32,620 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:32,620 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1635819412, now seen corresponding path program 1 times [2019-09-08 12:09:32,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:32,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:32,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:32,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:32,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:09:32,811 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:09:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:33,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:09:33,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:09:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:09:33,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:09:33,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:09:33,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:09:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:09:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:09:33,380 INFO L87 Difference]: Start difference. First operand 42186 states and 57884 transitions. Second operand 11 states. [2019-09-08 12:11:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:21,077 INFO L93 Difference]: Finished difference Result 189656 states and 259783 transitions. [2019-09-08 12:11:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:11:21,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 12:11:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:21,412 INFO L225 Difference]: With dead ends: 189656 [2019-09-08 12:11:21,412 INFO L226 Difference]: Without dead ends: 147606 [2019-09-08 12:11:21,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:11:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147606 states. [2019-09-08 12:12:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147606 to 65622. [2019-09-08 12:12:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65622 states. [2019-09-08 12:12:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65622 states to 65622 states and 89832 transitions. [2019-09-08 12:12:09,548 INFO L78 Accepts]: Start accepts. Automaton has 65622 states and 89832 transitions. Word has length 159 [2019-09-08 12:12:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:09,548 INFO L475 AbstractCegarLoop]: Abstraction has 65622 states and 89832 transitions. [2019-09-08 12:12:09,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:12:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65622 states and 89832 transitions. [2019-09-08 12:12:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:12:09,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:09,554 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:09,554 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 540383852, now seen corresponding path program 1 times [2019-09-08 12:12:09,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:09,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:09,658 INFO L87 Difference]: Start difference. First operand 65622 states and 89832 transitions. Second operand 3 states. [2019-09-08 12:12:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:56,009 INFO L93 Difference]: Finished difference Result 125962 states and 171694 transitions. [2019-09-08 12:12:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:56,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 12:12:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:56,114 INFO L225 Difference]: With dead ends: 125962 [2019-09-08 12:12:56,114 INFO L226 Difference]: Without dead ends: 60476 [2019-09-08 12:12:56,179 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 12:12:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60476 states. [2019-09-08 12:13:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60476 to 58818. [2019-09-08 12:13:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58818 states. [2019-09-08 12:13:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58818 states to 58818 states and 79182 transitions. [2019-09-08 12:13:40,128 INFO L78 Accepts]: Start accepts. Automaton has 58818 states and 79182 transitions. Word has length 159 [2019-09-08 12:13:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:40,128 INFO L475 AbstractCegarLoop]: Abstraction has 58818 states and 79182 transitions. [2019-09-08 12:13:40,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58818 states and 79182 transitions. [2019-09-08 12:13:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:13:40,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:40,134 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:40,134 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 705646096, now seen corresponding path program 1 times [2019-09-08 12:13:40,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:40,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:40,231 INFO L87 Difference]: Start difference. First operand 58818 states and 79182 transitions. Second operand 3 states. [2019-09-08 12:14:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:36,152 INFO L93 Difference]: Finished difference Result 130342 states and 174856 transitions. [2019-09-08 12:14:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:36,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:14:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:36,243 INFO L225 Difference]: With dead ends: 130342 [2019-09-08 12:14:36,243 INFO L226 Difference]: Without dead ends: 71660 [2019-09-08 12:14:36,293 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 12:14:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71660 states.