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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:37:04,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:37:04,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:37:04,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:37:04,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:37:04,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:37:04,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:37:04,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:37:04,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:37:04,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:37:04,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:37:04,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:37:04,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:37:04,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:37:04,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:37:04,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:37:04,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:37:04,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:37:04,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:37:04,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:37:04,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:37:04,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:37:04,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:37:04,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:37:04,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:37:04,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:37:04,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:37:04,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:37:04,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:37:04,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:37:04,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:37:04,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:37:04,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:37:04,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:37:04,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:37:04,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:37:04,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:37:04,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:37:04,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:37:04,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:37:04,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:37:04,521 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:37:04,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:37:04,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:37:04,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:37:04,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:37:04,537 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:37:04,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:37:04,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:37:04,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:37:04,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:37:04,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:37:04,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:37:04,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:37:04,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:37:04,539 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:37:04,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:37:04,539 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:37:04,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:37:04,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:37:04,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:37:04,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:37:04,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:37:04,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:37:04,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:37:04,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:37:04,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:37:04,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:37:04,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:37:04,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:37:04,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:37:04,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:37:04,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:37:04,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:37:04,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:37:04,589 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:37:04,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-08 12:37:04,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192f78326/d1bfbf05367b47baa92543a4a4249d2e/FLAG2c8de6500 [2019-09-08 12:37:05,709 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:37:05,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-08 12:37:05,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192f78326/d1bfbf05367b47baa92543a4a4249d2e/FLAG2c8de6500 [2019-09-08 12:37:05,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192f78326/d1bfbf05367b47baa92543a4a4249d2e [2019-09-08 12:37:06,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:37:06,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:37:06,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:06,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:37:06,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:37:06,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:05" (1/1) ... [2019-09-08 12:37:06,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195ab653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:06, skipping insertion in model container [2019-09-08 12:37:06,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:05" (1/1) ... [2019-09-08 12:37:06,025 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:37:06,465 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:37:09,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:09,890 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:37:12,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:12,353 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:37:12,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12 WrapperNode [2019-09-08 12:37:12,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:12,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:37:12,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:37:12,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:37:12,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (1/1) ... [2019-09-08 12:37:12,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:37:12,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:37:12,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:37:12,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:37:12,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (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:37:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:37:12,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:37:12,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:37:12,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:37:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:37:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:37:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:37:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:37:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:37:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:37:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:37:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:37:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:37:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:37:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:37:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:37:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:37:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:37:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:37:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:37:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:37:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:37:25,932 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:37:25,933 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:37:25,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:25 BoogieIcfgContainer [2019-09-08 12:37:25,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:37:25,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:37:25,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:37:25,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:37:25,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:37:05" (1/3) ... [2019-09-08 12:37:25,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b0d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:25, skipping insertion in model container [2019-09-08 12:37:25,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:12" (2/3) ... [2019-09-08 12:37:25,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b0d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:25, skipping insertion in model container [2019-09-08 12:37:25,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:25" (3/3) ... [2019-09-08 12:37:25,945 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-08 12:37:25,955 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:37:25,966 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-08 12:37:25,983 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-08 12:37:26,051 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:37:26,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:37:26,052 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:37:26,053 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:37:26,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:37:26,054 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:37:26,054 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:37:26,055 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:37:26,055 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:37:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states. [2019-09-08 12:37:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:37:26,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:26,277 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] [2019-09-08 12:37:26,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1706611694, now seen corresponding path program 1 times [2019-09-08 12:37:26,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:26,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:27,759 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:37:27,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:27,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:27,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:27,788 INFO L87 Difference]: Start difference. First operand 5472 states. Second operand 5 states. [2019-09-08 12:37:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:36,160 INFO L93 Difference]: Finished difference Result 9155 states and 15501 transitions. [2019-09-08 12:37:36,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:36,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:37:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:36,228 INFO L225 Difference]: With dead ends: 9155 [2019-09-08 12:37:36,228 INFO L226 Difference]: Without dead ends: 6443 [2019-09-08 12:37:36,248 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:37:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-09-08 12:37:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 6170. [2019-09-08 12:37:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-09-08 12:37:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 8133 transitions. [2019-09-08 12:37:36,567 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 8133 transitions. Word has length 106 [2019-09-08 12:37:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:36,568 INFO L475 AbstractCegarLoop]: Abstraction has 6170 states and 8133 transitions. [2019-09-08 12:37:36,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 8133 transitions. [2019-09-08 12:37:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:37:36,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:36,590 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] [2019-09-08 12:37:36,591 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1831821121, now seen corresponding path program 1 times [2019-09-08 12:37:36,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:36,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37: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:37:37,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:37,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:37,072 INFO L87 Difference]: Start difference. First operand 6170 states and 8133 transitions. Second operand 5 states. [2019-09-08 12:37:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:41,442 INFO L93 Difference]: Finished difference Result 8178 states and 10794 transitions. [2019-09-08 12:37:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:41,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:37:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:41,469 INFO L225 Difference]: With dead ends: 8178 [2019-09-08 12:37:41,469 INFO L226 Difference]: Without dead ends: 5175 [2019-09-08 12:37:41,478 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:37:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2019-09-08 12:37:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5175. [2019-09-08 12:37:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2019-09-08 12:37:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 6912 transitions. [2019-09-08 12:37:41,703 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 6912 transitions. Word has length 106 [2019-09-08 12:37:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:41,704 INFO L475 AbstractCegarLoop]: Abstraction has 5175 states and 6912 transitions. [2019-09-08 12:37:41,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 6912 transitions. [2019-09-08 12:37:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:37:41,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:41,719 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] [2019-09-08 12:37:41,720 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -836602696, now seen corresponding path program 1 times [2019-09-08 12:37:41,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:41,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:41,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:42,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:42,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:42,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:42,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:42,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:42,119 INFO L87 Difference]: Start difference. First operand 5175 states and 6912 transitions. Second operand 5 states. [2019-09-08 12:37:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:45,974 INFO L93 Difference]: Finished difference Result 6967 states and 9313 transitions. [2019-09-08 12:37:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:45,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:37:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:46,009 INFO L225 Difference]: With dead ends: 6967 [2019-09-08 12:37:46,009 INFO L226 Difference]: Without dead ends: 5047 [2019-09-08 12:37:46,015 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:37:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2019-09-08 12:37:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2019-09-08 12:37:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-09-08 12:37:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6766 transitions. [2019-09-08 12:37:46,240 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6766 transitions. Word has length 106 [2019-09-08 12:37:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:46,241 INFO L475 AbstractCegarLoop]: Abstraction has 5047 states and 6766 transitions. [2019-09-08 12:37:46,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6766 transitions. [2019-09-08 12:37:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:37:46,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:46,258 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] [2019-09-08 12:37:46,259 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 627581450, now seen corresponding path program 1 times [2019-09-08 12:37:46,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:46,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:46,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:46,646 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:37:46,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:46,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:46,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:46,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:46,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:46,648 INFO L87 Difference]: Start difference. First operand 5047 states and 6766 transitions. Second operand 5 states. [2019-09-08 12:37:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:49,451 INFO L93 Difference]: Finished difference Result 6242 states and 8328 transitions. [2019-09-08 12:37:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:49,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-08 12:37:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:49,473 INFO L225 Difference]: With dead ends: 6242 [2019-09-08 12:37:49,474 INFO L226 Difference]: Without dead ends: 3808 [2019-09-08 12:37:49,481 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:37:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2019-09-08 12:37:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3808. [2019-09-08 12:37:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3808 states. [2019-09-08 12:37:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5139 transitions. [2019-09-08 12:37:49,653 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5139 transitions. Word has length 108 [2019-09-08 12:37:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:49,653 INFO L475 AbstractCegarLoop]: Abstraction has 3808 states and 5139 transitions. [2019-09-08 12:37:49,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5139 transitions. [2019-09-08 12:37:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:37:49,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:49,665 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] [2019-09-08 12:37:49,666 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash -95068611, now seen corresponding path program 1 times [2019-09-08 12:37:49,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:50,079 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:37:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:50,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:50,082 INFO L87 Difference]: Start difference. First operand 3808 states and 5139 transitions. Second operand 5 states. [2019-09-08 12:37:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:52,090 INFO L93 Difference]: Finished difference Result 4604 states and 6159 transitions. [2019-09-08 12:37:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:52,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 12:37:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:52,105 INFO L225 Difference]: With dead ends: 4604 [2019-09-08 12:37:52,105 INFO L226 Difference]: Without dead ends: 2776 [2019-09-08 12:37:52,110 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:37:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-09-08 12:37:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2776. [2019-09-08 12:37:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2776 states. [2019-09-08 12:37:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3768 transitions. [2019-09-08 12:37:52,230 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3768 transitions. Word has length 110 [2019-09-08 12:37:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:52,231 INFO L475 AbstractCegarLoop]: Abstraction has 2776 states and 3768 transitions. [2019-09-08 12:37:52,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3768 transitions. [2019-09-08 12:37:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:37:52,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:52,239 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] [2019-09-08 12:37:52,240 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash -687550509, now seen corresponding path program 1 times [2019-09-08 12:37:52,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:52,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:52,661 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:37:52,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:52,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:52,663 INFO L87 Difference]: Start difference. First operand 2776 states and 3768 transitions. Second operand 5 states. [2019-09-08 12:37:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:54,284 INFO L93 Difference]: Finished difference Result 3987 states and 5414 transitions. [2019-09-08 12:37:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:54,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-08 12:37:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:54,297 INFO L225 Difference]: With dead ends: 3987 [2019-09-08 12:37:54,297 INFO L226 Difference]: Without dead ends: 2555 [2019-09-08 12:37:54,303 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:37:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-09-08 12:37:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-09-08 12:37:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-09-08 12:37:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3483 transitions. [2019-09-08 12:37:54,434 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3483 transitions. Word has length 112 [2019-09-08 12:37:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:54,435 INFO L475 AbstractCegarLoop]: Abstraction has 2555 states and 3483 transitions. [2019-09-08 12:37:54,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3483 transitions. [2019-09-08 12:37:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:37:54,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:54,442 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] [2019-09-08 12:37:54,443 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1363681434, now seen corresponding path program 1 times [2019-09-08 12:37:54,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:54,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:54,853 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:37:54,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:54,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:54,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:54,855 INFO L87 Difference]: Start difference. First operand 2555 states and 3483 transitions. Second operand 5 states. [2019-09-08 12:37:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:56,092 INFO L93 Difference]: Finished difference Result 2946 states and 3953 transitions. [2019-09-08 12:37:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:56,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-08 12:37:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:56,100 INFO L225 Difference]: With dead ends: 2946 [2019-09-08 12:37:56,100 INFO L226 Difference]: Without dead ends: 1738 [2019-09-08 12:37:56,103 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:37:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-08 12:37:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2019-09-08 12:37:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:37:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2381 transitions. [2019-09-08 12:37:56,184 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2381 transitions. Word has length 114 [2019-09-08 12:37:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:56,184 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2381 transitions. [2019-09-08 12:37:56,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2381 transitions. [2019-09-08 12:37:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:37:56,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:56,188 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] [2019-09-08 12:37:56,189 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:56,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1535694352, now seen corresponding path program 1 times [2019-09-08 12:37:56,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:56,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:56,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:56,759 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:37:56,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:56,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:56,762 INFO L87 Difference]: Start difference. First operand 1738 states and 2381 transitions. Second operand 9 states. [2019-09-08 12:38:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:00,230 INFO L93 Difference]: Finished difference Result 3242 states and 4481 transitions. [2019-09-08 12:38:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:38:00,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:38:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:00,239 INFO L225 Difference]: With dead ends: 3242 [2019-09-08 12:38:00,239 INFO L226 Difference]: Without dead ends: 2823 [2019-09-08 12:38:00,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:38:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-09-08 12:38:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1738. [2019-09-08 12:38:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2380 transitions. [2019-09-08 12:38:00,348 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2380 transitions. Word has length 116 [2019-09-08 12:38:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:00,349 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2380 transitions. [2019-09-08 12:38:00,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2380 transitions. [2019-09-08 12:38:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:38:00,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:00,353 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] [2019-09-08 12:38:00,354 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash 949695184, now seen corresponding path program 1 times [2019-09-08 12:38:00,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:00,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:00,930 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:38:00,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:00,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:00,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:00,932 INFO L87 Difference]: Start difference. First operand 1738 states and 2380 transitions. Second operand 9 states. [2019-09-08 12:38:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:04,290 INFO L93 Difference]: Finished difference Result 3196 states and 4418 transitions. [2019-09-08 12:38:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:04,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:38:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:04,297 INFO L225 Difference]: With dead ends: 3196 [2019-09-08 12:38:04,298 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:38:04,300 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:38:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:38:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:38:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2379 transitions. [2019-09-08 12:38:04,420 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2379 transitions. Word has length 116 [2019-09-08 12:38:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:04,421 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2379 transitions. [2019-09-08 12:38:04,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2379 transitions. [2019-09-08 12:38:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:38:04,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:04,425 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] [2019-09-08 12:38:04,426 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -629906736, now seen corresponding path program 1 times [2019-09-08 12:38:04,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:04,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:04,837 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:38:04,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:38:04,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:38:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:38:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:38:04,839 INFO L87 Difference]: Start difference. First operand 1738 states and 2379 transitions. Second operand 8 states. [2019-09-08 12:38:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:07,474 INFO L93 Difference]: Finished difference Result 3011 states and 3989 transitions. [2019-09-08 12:38:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:38:07,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2019-09-08 12:38:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:07,480 INFO L225 Difference]: With dead ends: 3011 [2019-09-08 12:38:07,481 INFO L226 Difference]: Without dead ends: 2280 [2019-09-08 12:38:07,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:38:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-09-08 12:38:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1738. [2019-09-08 12:38:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2378 transitions. [2019-09-08 12:38:07,614 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2378 transitions. Word has length 116 [2019-09-08 12:38:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:07,614 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2378 transitions. [2019-09-08 12:38:07,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:38:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2378 transitions. [2019-09-08 12:38:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:38:07,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:07,619 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] [2019-09-08 12:38:07,620 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 757155627, now seen corresponding path program 1 times [2019-09-08 12:38:07,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:07,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:08,085 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:38:08,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:08,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:08,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:08,087 INFO L87 Difference]: Start difference. First operand 1738 states and 2378 transitions. Second operand 9 states. [2019-09-08 12:38:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:11,377 INFO L93 Difference]: Finished difference Result 3191 states and 4411 transitions. [2019-09-08 12:38:11,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:11,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:38:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:11,385 INFO L225 Difference]: With dead ends: 3191 [2019-09-08 12:38:11,386 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:38:11,387 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:38:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:38:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:38:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2377 transitions. [2019-09-08 12:38:11,545 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2377 transitions. Word has length 117 [2019-09-08 12:38:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:11,546 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2377 transitions. [2019-09-08 12:38:11,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2377 transitions. [2019-09-08 12:38:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:38:11,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:11,550 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] [2019-09-08 12:38:11,551 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -762228437, now seen corresponding path program 1 times [2019-09-08 12:38:11,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:11,999 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:38:11,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:11,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:12,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:12,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:12,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:12,001 INFO L87 Difference]: Start difference. First operand 1738 states and 2377 transitions. Second operand 9 states. [2019-09-08 12:38:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:15,480 INFO L93 Difference]: Finished difference Result 3335 states and 4628 transitions. [2019-09-08 12:38:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:15,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:38:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:15,490 INFO L225 Difference]: With dead ends: 3335 [2019-09-08 12:38:15,490 INFO L226 Difference]: Without dead ends: 3052 [2019-09-08 12:38:15,492 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:38:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-08 12:38:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-08 12:38:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2376 transitions. [2019-09-08 12:38:15,631 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2376 transitions. Word has length 117 [2019-09-08 12:38:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:15,632 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2376 transitions. [2019-09-08 12:38:15,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2376 transitions. [2019-09-08 12:38:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:15,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:15,639 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] [2019-09-08 12:38:15,639 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1254114283, now seen corresponding path program 1 times [2019-09-08 12:38:15,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:15,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:16,146 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:38:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:16,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:16,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:16,149 INFO L87 Difference]: Start difference. First operand 1738 states and 2376 transitions. Second operand 9 states. [2019-09-08 12:38:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:19,844 INFO L93 Difference]: Finished difference Result 3356 states and 4649 transitions. [2019-09-08 12:38:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:19,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:19,851 INFO L225 Difference]: With dead ends: 3356 [2019-09-08 12:38:19,851 INFO L226 Difference]: Without dead ends: 3052 [2019-09-08 12:38:19,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-08 12:38:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-08 12:38:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2375 transitions. [2019-09-08 12:38:20,015 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2375 transitions. Word has length 118 [2019-09-08 12:38:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:20,015 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2375 transitions. [2019-09-08 12:38:20,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2019-09-08 12:38:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:20,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:20,019 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] [2019-09-08 12:38:20,025 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 734100853, now seen corresponding path program 1 times [2019-09-08 12:38:20,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:20,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:20,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:20,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:20,472 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:38:20,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:20,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:20,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:20,474 INFO L87 Difference]: Start difference. First operand 1738 states and 2375 transitions. Second operand 9 states. [2019-09-08 12:38:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:23,772 INFO L93 Difference]: Finished difference Result 3196 states and 4412 transitions. [2019-09-08 12:38:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:23,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:23,777 INFO L225 Difference]: With dead ends: 3196 [2019-09-08 12:38:23,777 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:38:23,779 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:38:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:38:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:38:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2374 transitions. [2019-09-08 12:38:23,916 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2374 transitions. Word has length 118 [2019-09-08 12:38:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:23,916 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2374 transitions. [2019-09-08 12:38:23,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2374 transitions. [2019-09-08 12:38:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:23,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:23,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,921 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash -148700306, now seen corresponding path program 1 times [2019-09-08 12:38:23,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:23,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:24,315 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:38:24,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:24,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:24,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:24,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:24,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:24,317 INFO L87 Difference]: Start difference. First operand 1738 states and 2374 transitions. Second operand 9 states. [2019-09-08 12:38:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:28,138 INFO L93 Difference]: Finished difference Result 3241 states and 4486 transitions. [2019-09-08 12:38:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:28,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:28,142 INFO L225 Difference]: With dead ends: 3241 [2019-09-08 12:38:28,142 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:38:28,143 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:38:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:38:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:38:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2373 transitions. [2019-09-08 12:38:28,288 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2373 transitions. Word has length 118 [2019-09-08 12:38:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:28,289 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2373 transitions. [2019-09-08 12:38:28,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2373 transitions. [2019-09-08 12:38:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:28,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:28,292 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] [2019-09-08 12:38:28,292 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:28,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1180685042, now seen corresponding path program 1 times [2019-09-08 12:38:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:28,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:38:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:28,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:28,690 INFO L87 Difference]: Start difference. First operand 1738 states and 2373 transitions. Second operand 9 states. [2019-09-08 12:38:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:32,360 INFO L93 Difference]: Finished difference Result 3128 states and 4302 transitions. [2019-09-08 12:38:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:32,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:32,365 INFO L225 Difference]: With dead ends: 3128 [2019-09-08 12:38:32,365 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:38:32,367 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:38:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:38:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:38:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2372 transitions. [2019-09-08 12:38:32,547 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2372 transitions. Word has length 118 [2019-09-08 12:38:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:32,547 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2372 transitions. [2019-09-08 12:38:32,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2372 transitions. [2019-09-08 12:38:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:32,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:32,550 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] [2019-09-08 12:38:32,550 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 312589973, now seen corresponding path program 1 times [2019-09-08 12:38:32,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:32,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:32,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:32,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:32,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:38:32,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:32,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:32,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:32,916 INFO L87 Difference]: Start difference. First operand 1738 states and 2372 transitions. Second operand 9 states. [2019-09-08 12:38:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:36,388 INFO L93 Difference]: Finished difference Result 2889 states and 4000 transitions. [2019-09-08 12:38:36,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:38:36,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:36,392 INFO L225 Difference]: With dead ends: 2889 [2019-09-08 12:38:36,392 INFO L226 Difference]: Without dead ends: 2175 [2019-09-08 12:38:36,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:38:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2019-09-08 12:38:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1738. [2019-09-08 12:38:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2370 transitions. [2019-09-08 12:38:36,532 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2370 transitions. Word has length 118 [2019-09-08 12:38:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:36,532 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2370 transitions. [2019-09-08 12:38:36,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2370 transitions. [2019-09-08 12:38:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:36,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:36,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, 1, 1, 1, 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:38:36,535 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash -981773131, now seen corresponding path program 1 times [2019-09-08 12:38:36,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:36,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:36,924 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:38:36,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:36,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:36,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:36,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:36,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:36,925 INFO L87 Difference]: Start difference. First operand 1738 states and 2370 transitions. Second operand 9 states. [2019-09-08 12:38:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:41,543 INFO L93 Difference]: Finished difference Result 3451 states and 4774 transitions. [2019-09-08 12:38:41,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:41,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:41,548 INFO L225 Difference]: With dead ends: 3451 [2019-09-08 12:38:41,548 INFO L226 Difference]: Without dead ends: 3052 [2019-09-08 12:38:41,550 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:38:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-08 12:38:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-08 12:38:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2368 transitions. [2019-09-08 12:38:41,686 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2368 transitions. Word has length 118 [2019-09-08 12:38:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:41,686 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2368 transitions. [2019-09-08 12:38:41,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2368 transitions. [2019-09-08 12:38:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:38:41,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:41,689 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] [2019-09-08 12:38:41,689 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash -701109227, now seen corresponding path program 1 times [2019-09-08 12:38:41,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:41,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:42,049 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:38:42,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:42,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:42,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:42,051 INFO L87 Difference]: Start difference. First operand 1738 states and 2368 transitions. Second operand 9 states. [2019-09-08 12:38:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:46,359 INFO L93 Difference]: Finished difference Result 3300 states and 4560 transitions. [2019-09-08 12:38:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:46,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:38:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:46,364 INFO L225 Difference]: With dead ends: 3300 [2019-09-08 12:38:46,364 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:38:46,366 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:38:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:38:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:38:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2366 transitions. [2019-09-08 12:38:46,507 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2366 transitions. Word has length 118 [2019-09-08 12:38:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:46,508 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2366 transitions. [2019-09-08 12:38:46,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2366 transitions. [2019-09-08 12:38:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:38:46,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:46,510 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] [2019-09-08 12:38:46,511 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1607911290, now seen corresponding path program 1 times [2019-09-08 12:38:46,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:46,878 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:38:46,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:46,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:46,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:46,880 INFO L87 Difference]: Start difference. First operand 1738 states and 2366 transitions. Second operand 9 states. [2019-09-08 12:38:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:50,955 INFO L93 Difference]: Finished difference Result 3190 states and 4396 transitions. [2019-09-08 12:38:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:50,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:38:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:50,960 INFO L225 Difference]: With dead ends: 3190 [2019-09-08 12:38:50,960 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:38:50,961 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:38:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:38:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:38:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2365 transitions. [2019-09-08 12:38:51,095 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2365 transitions. Word has length 119 [2019-09-08 12:38:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:51,095 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2365 transitions. [2019-09-08 12:38:51,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2365 transitions. [2019-09-08 12:38:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:38:51,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:51,098 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] [2019-09-08 12:38:51,098 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1929158234, now seen corresponding path program 1 times [2019-09-08 12:38:51,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:51,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:51,433 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:38:51,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:51,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:51,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:51,435 INFO L87 Difference]: Start difference. First operand 1738 states and 2365 transitions. Second operand 9 states. [2019-09-08 12:38:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:55,862 INFO L93 Difference]: Finished difference Result 3248 states and 4484 transitions. [2019-09-08 12:38:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:55,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:38:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:55,866 INFO L225 Difference]: With dead ends: 3248 [2019-09-08 12:38:55,866 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:38:55,868 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:38:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:38:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:38:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:38:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2364 transitions. [2019-09-08 12:38:56,078 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2364 transitions. Word has length 119 [2019-09-08 12:38:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:56,079 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2364 transitions. [2019-09-08 12:38:56,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2364 transitions. [2019-09-08 12:38:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:38:56,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:56,081 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] [2019-09-08 12:38:56,081 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1180944774, now seen corresponding path program 1 times [2019-09-08 12:38:56,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:56,455 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:38:56,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:56,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:56,456 INFO L87 Difference]: Start difference. First operand 1738 states and 2364 transitions. Second operand 9 states. [2019-09-08 12:39:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:00,444 INFO L93 Difference]: Finished difference Result 3191 states and 4395 transitions. [2019-09-08 12:39:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:00,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:39:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:00,449 INFO L225 Difference]: With dead ends: 3191 [2019-09-08 12:39:00,450 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:39:00,451 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:39:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:39:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:39:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2363 transitions. [2019-09-08 12:39:00,598 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2363 transitions. Word has length 119 [2019-09-08 12:39:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:00,599 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2363 transitions. [2019-09-08 12:39:00,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2363 transitions. [2019-09-08 12:39:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:39:00,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:00,601 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] [2019-09-08 12:39:00,601 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1976074246, now seen corresponding path program 1 times [2019-09-08 12:39:00,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:00,908 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:39:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:00,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:00,909 INFO L87 Difference]: Start difference. First operand 1738 states and 2363 transitions. Second operand 9 states. [2019-09-08 12:39:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:05,405 INFO L93 Difference]: Finished difference Result 3249 states and 4481 transitions. [2019-09-08 12:39:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:05,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:39:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:05,409 INFO L225 Difference]: With dead ends: 3249 [2019-09-08 12:39:05,409 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:39:05,410 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:39:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:39:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:39:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2362 transitions. [2019-09-08 12:39:05,580 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2362 transitions. Word has length 119 [2019-09-08 12:39:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:05,581 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2362 transitions. [2019-09-08 12:39:05,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2362 transitions. [2019-09-08 12:39:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:39:05,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:05,583 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] [2019-09-08 12:39:05,583 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -419426619, now seen corresponding path program 1 times [2019-09-08 12:39:05,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:05,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:05,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:05,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:05,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:05,885 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:39:05,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:05,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:05,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:05,887 INFO L87 Difference]: Start difference. First operand 1738 states and 2362 transitions. Second operand 9 states. [2019-09-08 12:39:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:10,007 INFO L93 Difference]: Finished difference Result 3126 states and 4288 transitions. [2019-09-08 12:39:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:10,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:39:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:10,011 INFO L225 Difference]: With dead ends: 3126 [2019-09-08 12:39:10,011 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:39:10,012 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:39:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:39:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:39:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2361 transitions. [2019-09-08 12:39:10,164 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2361 transitions. Word has length 119 [2019-09-08 12:39:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:10,164 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2361 transitions. [2019-09-08 12:39:10,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2361 transitions. [2019-09-08 12:39:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:39:10,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:10,167 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] [2019-09-08 12:39:10,167 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -991258011, now seen corresponding path program 1 times [2019-09-08 12:39:10,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:10,613 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:39:10,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:10,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:10,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:10,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:10,614 INFO L87 Difference]: Start difference. First operand 1738 states and 2361 transitions. Second operand 9 states. [2019-09-08 12:39:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:14,309 INFO L93 Difference]: Finished difference Result 3032 states and 4121 transitions. [2019-09-08 12:39:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:14,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:39:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:14,313 INFO L225 Difference]: With dead ends: 3032 [2019-09-08 12:39:14,313 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:39:14,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:39:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:39:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2360 transitions. [2019-09-08 12:39:14,479 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2360 transitions. Word has length 119 [2019-09-08 12:39:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:14,480 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2360 transitions. [2019-09-08 12:39:14,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2360 transitions. [2019-09-08 12:39:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:39:14,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:14,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:14,482 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 342204934, now seen corresponding path program 1 times [2019-09-08 12:39:14,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:14,846 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:39:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:14,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:14,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:14,847 INFO L87 Difference]: Start difference. First operand 1738 states and 2360 transitions. Second operand 9 states. [2019-09-08 12:39:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:19,143 INFO L93 Difference]: Finished difference Result 3215 states and 4424 transitions. [2019-09-08 12:39:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:19,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:39:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:19,148 INFO L225 Difference]: With dead ends: 3215 [2019-09-08 12:39:19,148 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:39:19,150 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:39:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:39:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:39:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2358 transitions. [2019-09-08 12:39:19,324 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2358 transitions. Word has length 119 [2019-09-08 12:39:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:19,324 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2358 transitions. [2019-09-08 12:39:19,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2358 transitions. [2019-09-08 12:39:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:19,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:19,327 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] [2019-09-08 12:39:19,327 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:19,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1920575674, now seen corresponding path program 1 times [2019-09-08 12:39:19,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:19,691 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:39:19,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:19,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:19,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:19,692 INFO L87 Difference]: Start difference. First operand 1738 states and 2358 transitions. Second operand 9 states. [2019-09-08 12:39:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:23,296 INFO L93 Difference]: Finished difference Result 3037 states and 4123 transitions. [2019-09-08 12:39:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:23,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:23,300 INFO L225 Difference]: With dead ends: 3037 [2019-09-08 12:39:23,300 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:39:23,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:39:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:39:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2357 transitions. [2019-09-08 12:39:23,475 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2357 transitions. Word has length 120 [2019-09-08 12:39:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:23,475 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2357 transitions. [2019-09-08 12:39:23,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2357 transitions. [2019-09-08 12:39:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:23,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:23,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,478 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 414540794, now seen corresponding path program 1 times [2019-09-08 12:39:23,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:23,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:23,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:23,765 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:39:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:23,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:23,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:23,766 INFO L87 Difference]: Start difference. First operand 1738 states and 2357 transitions. Second operand 9 states. [2019-09-08 12:39:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:27,523 INFO L93 Difference]: Finished difference Result 3205 states and 4401 transitions. [2019-09-08 12:39:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:27,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:27,526 INFO L225 Difference]: With dead ends: 3205 [2019-09-08 12:39:27,527 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:39:27,528 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:39:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:39:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:39:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2356 transitions. [2019-09-08 12:39:27,719 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2356 transitions. Word has length 120 [2019-09-08 12:39:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:27,719 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2356 transitions. [2019-09-08 12:39:27,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2356 transitions. [2019-09-08 12:39:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:27,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:27,722 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] [2019-09-08 12:39:27,722 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643994, now seen corresponding path program 1 times [2019-09-08 12:39:27,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:27,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:27,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:27,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:28,055 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:39:28,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:28,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:28,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:28,057 INFO L87 Difference]: Start difference. First operand 1738 states and 2356 transitions. Second operand 9 states. [2019-09-08 12:39:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:31,762 INFO L93 Difference]: Finished difference Result 3037 states and 4120 transitions. [2019-09-08 12:39:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:31,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:31,765 INFO L225 Difference]: With dead ends: 3037 [2019-09-08 12:39:31,765 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:39:31,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:39:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:39:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2355 transitions. [2019-09-08 12:39:31,968 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2355 transitions. Word has length 120 [2019-09-08 12:39:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:31,968 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2355 transitions. [2019-09-08 12:39:31,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2355 transitions. [2019-09-08 12:39:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:31,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:31,972 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] [2019-09-08 12:39:31,973 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1610669011, now seen corresponding path program 1 times [2019-09-08 12:39:31,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:32,404 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:39:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:32,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:32,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:32,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:32,406 INFO L87 Difference]: Start difference. First operand 1738 states and 2355 transitions. Second operand 9 states. [2019-09-08 12:39:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:36,627 INFO L93 Difference]: Finished difference Result 3128 states and 4281 transitions. [2019-09-08 12:39:36,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:36,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:36,631 INFO L225 Difference]: With dead ends: 3128 [2019-09-08 12:39:36,631 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:39:36,633 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:39:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:39:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:39:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2354 transitions. [2019-09-08 12:39:36,847 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2354 transitions. Word has length 120 [2019-09-08 12:39:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:36,848 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2354 transitions. [2019-09-08 12:39:36,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2354 transitions. [2019-09-08 12:39:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:36,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:36,851 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] [2019-09-08 12:39:36,851 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:36,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1051578547, now seen corresponding path program 1 times [2019-09-08 12:39:36,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:36,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:36,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:36,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:36,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:37,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:39:37,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:37,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:37,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:37,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:37,184 INFO L87 Difference]: Start difference. First operand 1738 states and 2354 transitions. Second operand 9 states. [2019-09-08 12:39:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:41,343 INFO L93 Difference]: Finished difference Result 3128 states and 4280 transitions. [2019-09-08 12:39:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:41,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:41,347 INFO L225 Difference]: With dead ends: 3128 [2019-09-08 12:39:41,347 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:39:41,348 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:39:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:39:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:39:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2353 transitions. [2019-09-08 12:39:41,535 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2353 transitions. Word has length 120 [2019-09-08 12:39:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:41,536 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2353 transitions. [2019-09-08 12:39:41,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2353 transitions. [2019-09-08 12:39:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:41,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:41,537 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] [2019-09-08 12:39:41,538 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1898617875, now seen corresponding path program 1 times [2019-09-08 12:39:41,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:41,911 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:39:41,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:41,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:41,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:41,913 INFO L87 Difference]: Start difference. First operand 1738 states and 2353 transitions. Second operand 9 states. [2019-09-08 12:39:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:46,215 INFO L93 Difference]: Finished difference Result 3188 states and 4376 transitions. [2019-09-08 12:39:46,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:46,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:46,224 INFO L225 Difference]: With dead ends: 3188 [2019-09-08 12:39:46,224 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:39:46,225 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:39:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:39:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:39:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2352 transitions. [2019-09-08 12:39:46,417 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2352 transitions. Word has length 120 [2019-09-08 12:39:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:46,418 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2352 transitions. [2019-09-08 12:39:46,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2352 transitions. [2019-09-08 12:39:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:46,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:46,420 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] [2019-09-08 12:39:46,420 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1831294950, now seen corresponding path program 1 times [2019-09-08 12:39:46,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:46,685 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:39:46,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:46,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:46,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:46,687 INFO L87 Difference]: Start difference. First operand 1738 states and 2352 transitions. Second operand 9 states. [2019-09-08 12:39:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:51,030 INFO L93 Difference]: Finished difference Result 3505 states and 4815 transitions. [2019-09-08 12:39:51,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:51,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:51,033 INFO L225 Difference]: With dead ends: 3505 [2019-09-08 12:39:51,033 INFO L226 Difference]: Without dead ends: 3052 [2019-09-08 12:39:51,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-08 12:39:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-08 12:39:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2350 transitions. [2019-09-08 12:39:51,235 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2350 transitions. Word has length 120 [2019-09-08 12:39:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:51,235 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2350 transitions. [2019-09-08 12:39:51,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2350 transitions. [2019-09-08 12:39:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:51,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:51,237 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] [2019-09-08 12:39:51,237 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash -465405286, now seen corresponding path program 1 times [2019-09-08 12:39:51,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:51,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:51,527 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:39:51,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:51,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:51,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:51,529 INFO L87 Difference]: Start difference. First operand 1738 states and 2350 transitions. Second operand 9 states. [2019-09-08 12:39:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:55,131 INFO L93 Difference]: Finished difference Result 3041 states and 4118 transitions. [2019-09-08 12:39:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:55,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:55,135 INFO L225 Difference]: With dead ends: 3041 [2019-09-08 12:39:55,135 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:39:55,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:39:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:39:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2348 transitions. [2019-09-08 12:39:55,411 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2348 transitions. Word has length 120 [2019-09-08 12:39:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:55,412 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2348 transitions. [2019-09-08 12:39:55,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2348 transitions. [2019-09-08 12:39:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:55,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:55,415 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] [2019-09-08 12:39:55,415 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -903457254, now seen corresponding path program 1 times [2019-09-08 12:39:55,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:55,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:55,701 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:39:55,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:55,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:55,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:55,702 INFO L87 Difference]: Start difference. First operand 1738 states and 2348 transitions. Second operand 9 states. [2019-09-08 12:39:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:59,303 INFO L93 Difference]: Finished difference Result 3230 states and 4425 transitions. [2019-09-08 12:39:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:59,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:59,307 INFO L225 Difference]: With dead ends: 3230 [2019-09-08 12:39:59,308 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:39:59,309 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:39:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:39:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:39:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:39:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2346 transitions. [2019-09-08 12:39:59,548 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2346 transitions. Word has length 120 [2019-09-08 12:39:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:59,548 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2346 transitions. [2019-09-08 12:39:59,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2346 transitions. [2019-09-08 12:39:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:59,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:59,550 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] [2019-09-08 12:39:59,550 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 348790202, now seen corresponding path program 1 times [2019-09-08 12:39:59,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:59,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:59,819 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:39:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:59,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:59,820 INFO L87 Difference]: Start difference. First operand 1738 states and 2346 transitions. Second operand 9 states. [2019-09-08 12:40:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:03,505 INFO L93 Difference]: Finished difference Result 3041 states and 4112 transitions. [2019-09-08 12:40:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:03,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:03,510 INFO L225 Difference]: With dead ends: 3041 [2019-09-08 12:40:03,510 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:03,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2344 transitions. [2019-09-08 12:40:03,738 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2344 transitions. Word has length 120 [2019-09-08 12:40:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:03,738 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2344 transitions. [2019-09-08 12:40:03,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2344 transitions. [2019-09-08 12:40:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:03,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:03,740 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] [2019-09-08 12:40:03,740 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2082138234, now seen corresponding path program 1 times [2019-09-08 12:40:03,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:03,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:03,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:04,036 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:40:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:04,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:04,038 INFO L87 Difference]: Start difference. First operand 1738 states and 2344 transitions. Second operand 9 states. [2019-09-08 12:40:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:07,617 INFO L93 Difference]: Finished difference Result 2867 states and 3850 transitions. [2019-09-08 12:40:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:07,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:07,620 INFO L225 Difference]: With dead ends: 2867 [2019-09-08 12:40:07,620 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:07,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2342 transitions. [2019-09-08 12:40:07,832 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2342 transitions. Word has length 120 [2019-09-08 12:40:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:07,832 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2342 transitions. [2019-09-08 12:40:07,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2342 transitions. [2019-09-08 12:40:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:07,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:07,835 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] [2019-09-08 12:40:07,835 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1500413926, now seen corresponding path program 1 times [2019-09-08 12:40:07,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:07,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:08,107 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:40:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:08,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:08,109 INFO L87 Difference]: Start difference. First operand 1738 states and 2342 transitions. Second operand 9 states. [2019-09-08 12:40:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:12,159 INFO L93 Difference]: Finished difference Result 3301 states and 4521 transitions. [2019-09-08 12:40:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:12,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:12,163 INFO L225 Difference]: With dead ends: 3301 [2019-09-08 12:40:12,163 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:40:12,164 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:40:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:40:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:40:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2340 transitions. [2019-09-08 12:40:12,395 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2340 transitions. Word has length 120 [2019-09-08 12:40:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:12,395 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2340 transitions. [2019-09-08 12:40:12,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2340 transitions. [2019-09-08 12:40:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:12,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:12,397 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] [2019-09-08 12:40:12,397 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1689078298, now seen corresponding path program 1 times [2019-09-08 12:40:12,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:12,699 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:40:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:12,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:12,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:12,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:12,700 INFO L87 Difference]: Start difference. First operand 1738 states and 2340 transitions. Second operand 9 states. [2019-09-08 12:40:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:16,311 INFO L93 Difference]: Finished difference Result 2867 states and 3844 transitions. [2019-09-08 12:40:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:16,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:16,315 INFO L225 Difference]: With dead ends: 2867 [2019-09-08 12:40:16,315 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:16,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2338 transitions. [2019-09-08 12:40:16,544 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2338 transitions. Word has length 120 [2019-09-08 12:40:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:16,544 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2338 transitions. [2019-09-08 12:40:16,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2338 transitions. [2019-09-08 12:40:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:16,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:16,546 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] [2019-09-08 12:40:16,546 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1888231326, now seen corresponding path program 1 times [2019-09-08 12:40:16,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:16,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:16,794 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:40:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:16,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:16,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:16,795 INFO L87 Difference]: Start difference. First operand 1738 states and 2338 transitions. Second operand 9 states. [2019-09-08 12:40:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:20,868 INFO L93 Difference]: Finished difference Result 3137 states and 4270 transitions. [2019-09-08 12:40:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:20,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:20,872 INFO L225 Difference]: With dead ends: 3137 [2019-09-08 12:40:20,872 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:40:20,873 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:40:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:40:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:40:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2336 transitions. [2019-09-08 12:40:21,100 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2336 transitions. Word has length 120 [2019-09-08 12:40:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2336 transitions. [2019-09-08 12:40:21,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2336 transitions. [2019-09-08 12:40:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:21,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:21,102 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] [2019-09-08 12:40:21,102 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -79841087, now seen corresponding path program 1 times [2019-09-08 12:40:21,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:21,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:21,361 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:40:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:21,362 INFO L87 Difference]: Start difference. First operand 1738 states and 2336 transitions. Second operand 9 states. [2019-09-08 12:40:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:25,640 INFO L93 Difference]: Finished difference Result 3196 states and 4362 transitions. [2019-09-08 12:40:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:25,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:25,644 INFO L225 Difference]: With dead ends: 3196 [2019-09-08 12:40:25,644 INFO L226 Difference]: Without dead ends: 2997 [2019-09-08 12:40:25,645 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:40:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-08 12:40:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-08 12:40:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2335 transitions. [2019-09-08 12:40:25,881 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2335 transitions. Word has length 121 [2019-09-08 12:40:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:25,882 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2335 transitions. [2019-09-08 12:40:25,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2335 transitions. [2019-09-08 12:40:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:25,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:25,883 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] [2019-09-08 12:40:25,884 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash 489427169, now seen corresponding path program 1 times [2019-09-08 12:40:25,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:25,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:25,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:25,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:26,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:26,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:26,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:26,123 INFO L87 Difference]: Start difference. First operand 1738 states and 2335 transitions. Second operand 9 states. [2019-09-08 12:40:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:30,477 INFO L93 Difference]: Finished difference Result 3129 states and 4256 transitions. [2019-09-08 12:40:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:30,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:30,481 INFO L225 Difference]: With dead ends: 3129 [2019-09-08 12:40:30,481 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:40:30,482 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:40:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:40:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:40:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2334 transitions. [2019-09-08 12:40:30,723 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2334 transitions. Word has length 121 [2019-09-08 12:40:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:30,723 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2334 transitions. [2019-09-08 12:40:30,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2334 transitions. [2019-09-08 12:40:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:30,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,725 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1272510785, now seen corresponding path program 1 times [2019-09-08 12:40:30,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:30,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:30,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:31,035 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:40:31,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:31,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:31,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:31,037 INFO L87 Difference]: Start difference. First operand 1738 states and 2334 transitions. Second operand 9 states. [2019-09-08 12:40:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:35,780 INFO L93 Difference]: Finished difference Result 3263 states and 4454 transitions. [2019-09-08 12:40:35,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:35,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:35,785 INFO L225 Difference]: With dead ends: 3263 [2019-09-08 12:40:35,785 INFO L226 Difference]: Without dead ends: 3021 [2019-09-08 12:40:35,787 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:40:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-08 12:40:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-08 12:40:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2333 transitions. [2019-09-08 12:40:36,033 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2333 transitions. Word has length 121 [2019-09-08 12:40:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:36,034 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2333 transitions. [2019-09-08 12:40:36,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2333 transitions. [2019-09-08 12:40:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:36,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,036 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1708619935, now seen corresponding path program 1 times [2019-09-08 12:40:36,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:36,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:36,279 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:40:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:36,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:36,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:36,280 INFO L87 Difference]: Start difference. First operand 1738 states and 2333 transitions. Second operand 9 states. [2019-09-08 12:40:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:40,005 INFO L93 Difference]: Finished difference Result 3034 states and 4085 transitions. [2019-09-08 12:40:40,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:40,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:40,009 INFO L225 Difference]: With dead ends: 3034 [2019-09-08 12:40:40,009 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:40,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2332 transitions. [2019-09-08 12:40:40,260 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2332 transitions. Word has length 121 [2019-09-08 12:40:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:40,260 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2332 transitions. [2019-09-08 12:40:40,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2332 transitions. [2019-09-08 12:40:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:40,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:40,262 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] [2019-09-08 12:40:40,263 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 811094624, now seen corresponding path program 1 times [2019-09-08 12:40:40,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:40,536 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:40:40,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:40,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:40,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:40,537 INFO L87 Difference]: Start difference. First operand 1738 states and 2332 transitions. Second operand 9 states. [2019-09-08 12:40:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:44,366 INFO L93 Difference]: Finished difference Result 3032 states and 4081 transitions. [2019-09-08 12:40:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:44,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:44,369 INFO L225 Difference]: With dead ends: 3032 [2019-09-08 12:40:44,369 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:44,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2331 transitions. [2019-09-08 12:40:44,622 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2331 transitions. Word has length 121 [2019-09-08 12:40:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:44,623 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2331 transitions. [2019-09-08 12:40:44,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2331 transitions. [2019-09-08 12:40:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:44,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:44,625 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] [2019-09-08 12:40:44,625 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -516460637, now seen corresponding path program 1 times [2019-09-08 12:40:44,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:44,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:44,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:44,883 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:40:44,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:44,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:44,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:44,884 INFO L87 Difference]: Start difference. First operand 1738 states and 2331 transitions. Second operand 9 states. [2019-09-08 12:40:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:48,696 INFO L93 Difference]: Finished difference Result 3127 states and 4250 transitions. [2019-09-08 12:40:48,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:48,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:48,700 INFO L225 Difference]: With dead ends: 3127 [2019-09-08 12:40:48,700 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:40:48,702 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:40:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:40:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:40:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2330 transitions. [2019-09-08 12:40:48,961 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2330 transitions. Word has length 121 [2019-09-08 12:40:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:48,962 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2330 transitions. [2019-09-08 12:40:48,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2330 transitions. [2019-09-08 12:40:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:48,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:48,964 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] [2019-09-08 12:40:48,964 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1705722879, now seen corresponding path program 1 times [2019-09-08 12:40:48,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:48,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:48,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:49,258 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:40:49,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:49,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:49,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:49,259 INFO L87 Difference]: Start difference. First operand 1738 states and 2330 transitions. Second operand 9 states. [2019-09-08 12:40:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:53,196 INFO L93 Difference]: Finished difference Result 3034 states and 4081 transitions. [2019-09-08 12:40:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:53,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:53,200 INFO L225 Difference]: With dead ends: 3034 [2019-09-08 12:40:53,201 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:53,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2329 transitions. [2019-09-08 12:40:53,468 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2329 transitions. Word has length 121 [2019-09-08 12:40:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:53,469 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2329 transitions. [2019-09-08 12:40:53,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2329 transitions. [2019-09-08 12:40:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:53,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:53,470 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] [2019-09-08 12:40:53,471 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2011964607, now seen corresponding path program 1 times [2019-09-08 12:40:53,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:53,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:53,733 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:40:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:53,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:53,734 INFO L87 Difference]: Start difference. First operand 1738 states and 2329 transitions. Second operand 9 states. [2019-09-08 12:40:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:57,353 INFO L93 Difference]: Finished difference Result 3034 states and 4079 transitions. [2019-09-08 12:40:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:57,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:57,357 INFO L225 Difference]: With dead ends: 3034 [2019-09-08 12:40:57,357 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:40:57,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:40:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:40:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:40:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2328 transitions. [2019-09-08 12:40:57,631 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2328 transitions. Word has length 121 [2019-09-08 12:40:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:57,631 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2328 transitions. [2019-09-08 12:40:57,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2328 transitions. [2019-09-08 12:40:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:57,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:57,633 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] [2019-09-08 12:40:57,633 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash -358628288, now seen corresponding path program 1 times [2019-09-08 12:40:57,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:57,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:40:57,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:57,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:57,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:57,896 INFO L87 Difference]: Start difference. First operand 1738 states and 2328 transitions. Second operand 9 states. [2019-09-08 12:41:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:01,374 INFO L93 Difference]: Finished difference Result 3032 states and 4075 transitions. [2019-09-08 12:41:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:01,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:01,378 INFO L225 Difference]: With dead ends: 3032 [2019-09-08 12:41:01,378 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:41:01,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:41:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:41:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:41:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2327 transitions. [2019-09-08 12:41:01,717 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2327 transitions. Word has length 121 [2019-09-08 12:41:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:01,717 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2327 transitions. [2019-09-08 12:41:01,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2327 transitions. [2019-09-08 12:41:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:01,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:01,719 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] [2019-09-08 12:41:01,719 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -898485247, now seen corresponding path program 1 times [2019-09-08 12:41:01,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:01,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:02,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:02,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:02,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:02,052 INFO L87 Difference]: Start difference. First operand 1738 states and 2327 transitions. Second operand 9 states. [2019-09-08 12:41:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:06,412 INFO L93 Difference]: Finished difference Result 3129 states and 4246 transitions. [2019-09-08 12:41:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:06,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:06,416 INFO L225 Difference]: With dead ends: 3129 [2019-09-08 12:41:06,416 INFO L226 Difference]: Without dead ends: 2949 [2019-09-08 12:41:06,418 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:41:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-08 12:41:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-08 12:41:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:41:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2326 transitions. [2019-09-08 12:41:06,711 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2326 transitions. Word has length 121 [2019-09-08 12:41:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:06,711 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2326 transitions. [2019-09-08 12:41:06,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2326 transitions. [2019-09-08 12:41:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:06,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:06,713 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] [2019-09-08 12:41:06,713 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash -847780959, now seen corresponding path program 1 times [2019-09-08 12:41:06,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:06,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:06,980 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:41:06,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:06,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:06,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:06,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:06,981 INFO L87 Difference]: Start difference. First operand 1738 states and 2326 transitions. Second operand 9 states. [2019-09-08 12:41:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:10,858 INFO L93 Difference]: Finished difference Result 3034 states and 4075 transitions. [2019-09-08 12:41:10,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:10,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:10,862 INFO L225 Difference]: With dead ends: 3034 [2019-09-08 12:41:10,862 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:41:10,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:41:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:41:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:41:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2325 transitions. [2019-09-08 12:41:11,147 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2325 transitions. Word has length 121 [2019-09-08 12:41:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:11,148 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2325 transitions. [2019-09-08 12:41:11,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2325 transitions. [2019-09-08 12:41:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:11,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:11,150 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] [2019-09-08 12:41:11,150 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -510563488, now seen corresponding path program 1 times [2019-09-08 12:41:11,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:11,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:11,419 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:41:11,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:11,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:11,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:11,420 INFO L87 Difference]: Start difference. First operand 1738 states and 2325 transitions. Second operand 9 states. [2019-09-08 12:41:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:15,618 INFO L93 Difference]: Finished difference Result 3032 states and 4071 transitions. [2019-09-08 12:41:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:15,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:15,621 INFO L225 Difference]: With dead ends: 3032 [2019-09-08 12:41:15,621 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:41:15,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:41:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:41:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:41:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2324 transitions. [2019-09-08 12:41:15,912 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2324 transitions. Word has length 121 [2019-09-08 12:41:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:15,912 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2324 transitions. [2019-09-08 12:41:15,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2324 transitions. [2019-09-08 12:41:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:15,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:15,914 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] [2019-09-08 12:41:15,915 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash -667441760, now seen corresponding path program 1 times [2019-09-08 12:41:15,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:15,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:16,168 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:41:16,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:16,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:16,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:16,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:16,169 INFO L87 Difference]: Start difference. First operand 1738 states and 2324 transitions. Second operand 9 states. [2019-09-08 12:41:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:20,091 INFO L93 Difference]: Finished difference Result 3032 states and 4070 transitions. [2019-09-08 12:41:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:20,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:20,096 INFO L225 Difference]: With dead ends: 3032 [2019-09-08 12:41:20,096 INFO L226 Difference]: Without dead ends: 2861 [2019-09-08 12:41:20,098 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:41:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-08 12:41:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-08 12:41:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-08 12:41:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2323 transitions. [2019-09-08 12:41:20,389 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2323 transitions. Word has length 121 [2019-09-08 12:41:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:20,389 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2323 transitions. [2019-09-08 12:41:20,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2323 transitions. [2019-09-08 12:41:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:20,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:20,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:20,391 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1389878040, now seen corresponding path program 1 times [2019-09-08 12:41:20,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:20,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:20,715 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:41:20,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:20,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:20,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:20,717 INFO L87 Difference]: Start difference. First operand 1738 states and 2323 transitions. Second operand 9 states. [2019-09-08 12:41:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:24,612 INFO L93 Difference]: Finished difference Result 3000 states and 4017 transitions. [2019-09-08 12:41:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:24,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:24,616 INFO L225 Difference]: With dead ends: 3000 [2019-09-08 12:41:24,616 INFO L226 Difference]: Without dead ends: 2830 [2019-09-08 12:41:24,618 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:41:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-09-08 12:41:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 1741. [2019-09-08 12:41:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2327 transitions. [2019-09-08 12:41:24,915 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2327 transitions. Word has length 121 [2019-09-08 12:41:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:24,915 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2327 transitions. [2019-09-08 12:41:24,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2327 transitions. [2019-09-08 12:41:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:24,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:24,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, 1, 1, 1, 1, 1, 1, 1, 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:41:24,917 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1633368833, now seen corresponding path program 1 times [2019-09-08 12:41:24,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:24,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:25,233 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:41:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:25,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:25,234 INFO L87 Difference]: Start difference. First operand 1741 states and 2327 transitions. Second operand 9 states. [2019-09-08 12:41:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:29,120 INFO L93 Difference]: Finished difference Result 3038 states and 4074 transitions. [2019-09-08 12:41:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:29,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:29,124 INFO L225 Difference]: With dead ends: 3038 [2019-09-08 12:41:29,124 INFO L226 Difference]: Without dead ends: 2862 [2019-09-08 12:41:29,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-08 12:41:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-08 12:41:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2325 transitions. [2019-09-08 12:41:29,423 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2325 transitions. Word has length 121 [2019-09-08 12:41:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:29,424 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2325 transitions. [2019-09-08 12:41:29,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2325 transitions. [2019-09-08 12:41:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:29,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,426 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1032824543, now seen corresponding path program 1 times [2019-09-08 12:41:29,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:29,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:29,695 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:41:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:29,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:29,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:29,697 INFO L87 Difference]: Start difference. First operand 1741 states and 2325 transitions. Second operand 9 states. [2019-09-08 12:41:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:34,201 INFO L93 Difference]: Finished difference Result 3226 states and 4383 transitions. [2019-09-08 12:41:34,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:34,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:34,205 INFO L225 Difference]: With dead ends: 3226 [2019-09-08 12:41:34,205 INFO L226 Difference]: Without dead ends: 3000 [2019-09-08 12:41:34,206 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:41:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-08 12:41:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-08 12:41:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2323 transitions. [2019-09-08 12:41:34,566 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2323 transitions. Word has length 121 [2019-09-08 12:41:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:34,566 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2323 transitions. [2019-09-08 12:41:34,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2323 transitions. [2019-09-08 12:41:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:34,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:34,568 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] [2019-09-08 12:41:34,568 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1566152575, now seen corresponding path program 1 times [2019-09-08 12:41:34,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:34,823 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:41:34,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:34,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:34,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:34,824 INFO L87 Difference]: Start difference. First operand 1741 states and 2323 transitions. Second operand 9 states. [2019-09-08 12:41:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:38,604 INFO L93 Difference]: Finished difference Result 3038 states and 4068 transitions. [2019-09-08 12:41:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:38,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:38,608 INFO L225 Difference]: With dead ends: 3038 [2019-09-08 12:41:38,608 INFO L226 Difference]: Without dead ends: 2862 [2019-09-08 12:41:38,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-08 12:41:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-08 12:41:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2321 transitions. [2019-09-08 12:41:38,906 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2321 transitions. Word has length 121 [2019-09-08 12:41:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:38,906 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2321 transitions. [2019-09-08 12:41:38,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2321 transitions. [2019-09-08 12:41:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:38,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:38,907 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] [2019-09-08 12:41:38,908 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1563798271, now seen corresponding path program 1 times [2019-09-08 12:41:38,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:38,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:38,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:38,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:39,142 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:41:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:39,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:39,143 INFO L87 Difference]: Start difference. First operand 1741 states and 2321 transitions. Second operand 9 states. [2019-09-08 12:41:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:43,825 INFO L93 Difference]: Finished difference Result 3323 states and 4514 transitions. [2019-09-08 12:41:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:43,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:43,830 INFO L225 Difference]: With dead ends: 3323 [2019-09-08 12:41:43,830 INFO L226 Difference]: Without dead ends: 3024 [2019-09-08 12:41:43,831 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:41:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2019-09-08 12:41:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 1741. [2019-09-08 12:41:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2319 transitions. [2019-09-08 12:41:44,142 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2319 transitions. Word has length 121 [2019-09-08 12:41:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:44,142 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2319 transitions. [2019-09-08 12:41:44,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2319 transitions. [2019-09-08 12:41:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:44,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:44,144 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] [2019-09-08 12:41:44,144 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1949660417, now seen corresponding path program 1 times [2019-09-08 12:41:44,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:44,440 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:41:44,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:44,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:44,441 INFO L87 Difference]: Start difference. First operand 1741 states and 2319 transitions. Second operand 9 states. [2019-09-08 12:41:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:48,820 INFO L93 Difference]: Finished difference Result 3142 states and 4250 transitions. [2019-09-08 12:41:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:48,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:48,824 INFO L225 Difference]: With dead ends: 3142 [2019-09-08 12:41:48,824 INFO L226 Difference]: Without dead ends: 2952 [2019-09-08 12:41:48,825 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:41:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-08 12:41:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-08 12:41:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2317 transitions. [2019-09-08 12:41:49,133 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2317 transitions. Word has length 121 [2019-09-08 12:41:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:49,133 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2317 transitions. [2019-09-08 12:41:49,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2317 transitions. [2019-09-08 12:41:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:49,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:49,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,135 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1068773343, now seen corresponding path program 1 times [2019-09-08 12:41:49,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:49,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:49,391 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:41:49,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:49,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:49,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:49,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:49,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:49,392 INFO L87 Difference]: Start difference. First operand 1741 states and 2317 transitions. Second operand 9 states. [2019-09-08 12:41:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:53,145 INFO L93 Difference]: Finished difference Result 3038 states and 4062 transitions. [2019-09-08 12:41:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:53,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:53,149 INFO L225 Difference]: With dead ends: 3038 [2019-09-08 12:41:53,149 INFO L226 Difference]: Without dead ends: 2862 [2019-09-08 12:41:53,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-08 12:41:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-08 12:41:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2315 transitions. [2019-09-08 12:41:53,467 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2315 transitions. Word has length 121 [2019-09-08 12:41:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:53,467 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2315 transitions. [2019-09-08 12:41:53,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2315 transitions. [2019-09-08 12:41:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:53,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:53,470 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] [2019-09-08 12:41:53,470 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 636558369, now seen corresponding path program 1 times [2019-09-08 12:41:53,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:53,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:53,801 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:41:53,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:53,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:53,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:53,802 INFO L87 Difference]: Start difference. First operand 1741 states and 2315 transitions. Second operand 9 states. [2019-09-08 12:41:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:57,755 INFO L93 Difference]: Finished difference Result 3221 states and 4362 transitions. [2019-09-08 12:41:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:57,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:57,759 INFO L225 Difference]: With dead ends: 3221 [2019-09-08 12:41:57,759 INFO L226 Difference]: Without dead ends: 3000 [2019-09-08 12:41:57,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-08 12:41:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-08 12:41:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:41:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2313 transitions. [2019-09-08 12:41:58,076 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2313 transitions. Word has length 121 [2019-09-08 12:41:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:58,076 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2313 transitions. [2019-09-08 12:41:58,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2313 transitions. [2019-09-08 12:41:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:58,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:58,079 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] [2019-09-08 12:41:58,079 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1339146721, now seen corresponding path program 1 times [2019-09-08 12:41:58,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:58,350 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:41:58,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:58,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:58,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:58,351 INFO L87 Difference]: Start difference. First operand 1741 states and 2313 transitions. Second operand 9 states. [2019-09-08 12:42:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:02,556 INFO L93 Difference]: Finished difference Result 3221 states and 4362 transitions. [2019-09-08 12:42:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:02,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:42:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:02,560 INFO L225 Difference]: With dead ends: 3221 [2019-09-08 12:42:02,560 INFO L226 Difference]: Without dead ends: 3000 [2019-09-08 12:42:02,561 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:42:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-08 12:42:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-08 12:42:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:42:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2311 transitions. [2019-09-08 12:42:02,882 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2311 transitions. Word has length 121 [2019-09-08 12:42:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:02,882 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2311 transitions. [2019-09-08 12:42:02,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2311 transitions. [2019-09-08 12:42:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:42:02,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:02,884 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] [2019-09-08 12:42:02,884 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1642718527, now seen corresponding path program 1 times [2019-09-08 12:42:02,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:03,138 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:42:03,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:03,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:03,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:03,139 INFO L87 Difference]: Start difference. First operand 1741 states and 2311 transitions. Second operand 9 states. [2019-09-08 12:42:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:07,588 INFO L93 Difference]: Finished difference Result 3142 states and 4240 transitions. [2019-09-08 12:42:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:07,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:42:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:07,591 INFO L225 Difference]: With dead ends: 3142 [2019-09-08 12:42:07,591 INFO L226 Difference]: Without dead ends: 2952 [2019-09-08 12:42:07,592 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:42:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-08 12:42:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-08 12:42:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:42:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2309 transitions. [2019-09-08 12:42:07,916 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2309 transitions. Word has length 121 [2019-09-08 12:42:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:07,917 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2309 transitions. [2019-09-08 12:42:07,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2309 transitions. [2019-09-08 12:42:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:42:07,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:07,918 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] [2019-09-08 12:42:07,919 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1105224289, now seen corresponding path program 1 times [2019-09-08 12:42:07,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:07,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:07,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:08,166 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:42:08,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:08,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:08,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:08,168 INFO L87 Difference]: Start difference. First operand 1741 states and 2309 transitions. Second operand 9 states. [2019-09-08 12:42:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:12,615 INFO L93 Difference]: Finished difference Result 3142 states and 4238 transitions. [2019-09-08 12:42:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:12,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:42:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:12,620 INFO L225 Difference]: With dead ends: 3142 [2019-09-08 12:42:12,620 INFO L226 Difference]: Without dead ends: 2952 [2019-09-08 12:42:12,622 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:42:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-08 12:42:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-08 12:42:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:42:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2307 transitions. [2019-09-08 12:42:12,966 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2307 transitions. Word has length 121 [2019-09-08 12:42:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:12,966 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2307 transitions. [2019-09-08 12:42:12,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2307 transitions. [2019-09-08 12:42:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:42:12,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:12,969 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] [2019-09-08 12:42:12,969 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1880826624, now seen corresponding path program 1 times [2019-09-08 12:42:12,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:12,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:12,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:12,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:13,222 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:42:13,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:13,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:13,224 INFO L87 Difference]: Start difference. First operand 1741 states and 2307 transitions. Second operand 9 states. [2019-09-08 12:42:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:16,889 INFO L93 Difference]: Finished difference Result 3034 states and 4048 transitions. [2019-09-08 12:42:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:16,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:42:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:16,893 INFO L225 Difference]: With dead ends: 3034 [2019-09-08 12:42:16,893 INFO L226 Difference]: Without dead ends: 2862 [2019-09-08 12:42:16,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-08 12:42:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-08 12:42:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:42:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2305 transitions. [2019-09-08 12:42:17,230 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2305 transitions. Word has length 121 [2019-09-08 12:42:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:17,230 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2305 transitions. [2019-09-08 12:42:17,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2305 transitions. [2019-09-08 12:42:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:17,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:17,232 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:42:17,232 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2137513151, now seen corresponding path program 1 times [2019-09-08 12:42:17,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:17,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:17,477 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:42:17,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:17,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:17,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:17,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:17,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:17,478 INFO L87 Difference]: Start difference. First operand 1741 states and 2305 transitions. Second operand 9 states. [2019-09-08 12:42:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:21,716 INFO L93 Difference]: Finished difference Result 3136 states and 4223 transitions. [2019-09-08 12:42:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:21,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:21,719 INFO L225 Difference]: With dead ends: 3136 [2019-09-08 12:42:21,719 INFO L226 Difference]: Without dead ends: 2952 [2019-09-08 12:42:21,720 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:42:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-08 12:42:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-08 12:42:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 12:42:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2304 transitions. [2019-09-08 12:42:22,057 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2304 transitions. Word has length 122 [2019-09-08 12:42:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:22,057 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2304 transitions. [2019-09-08 12:42:22,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2304 transitions. [2019-09-08 12:42:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:22,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:22,059 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:42:22,060 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:22,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1004087310, now seen corresponding path program 1 times [2019-09-08 12:42:22,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:22,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:22,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:22,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:22,979 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:42:22,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:22,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:42:22,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:42:22,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:42:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:42:22,980 INFO L87 Difference]: Start difference. First operand 1741 states and 2304 transitions. Second operand 15 states. [2019-09-08 12:42:23,847 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 12:42:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:27,178 INFO L93 Difference]: Finished difference Result 2487 states and 3330 transitions. [2019-09-08 12:42:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:42:27,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 122 [2019-09-08 12:42:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:27,180 INFO L225 Difference]: With dead ends: 2487 [2019-09-08 12:42:27,180 INFO L226 Difference]: Without dead ends: 1853 [2019-09-08 12:42:27,182 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:42:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-09-08 12:42:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1527. [2019-09-08 12:42:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2016 transitions. [2019-09-08 12:42:27,484 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2016 transitions. Word has length 122 [2019-09-08 12:42:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:27,484 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2016 transitions. [2019-09-08 12:42:27,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:42:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2016 transitions. [2019-09-08 12:42:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:27,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:27,486 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:42:27,486 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2096009535, now seen corresponding path program 1 times [2019-09-08 12:42:27,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:27,908 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:42:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:27,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:27,910 INFO L87 Difference]: Start difference. First operand 1527 states and 2016 transitions. Second operand 9 states. [2019-09-08 12:42:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:31,633 INFO L93 Difference]: Finished difference Result 2909 states and 3931 transitions. [2019-09-08 12:42:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:31,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:31,636 INFO L225 Difference]: With dead ends: 2909 [2019-09-08 12:42:31,636 INFO L226 Difference]: Without dead ends: 2676 [2019-09-08 12:42:31,637 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:42:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-09-08 12:42:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1527. [2019-09-08 12:42:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2014 transitions. [2019-09-08 12:42:31,940 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2014 transitions. Word has length 122 [2019-09-08 12:42:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:31,940 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2014 transitions. [2019-09-08 12:42:31,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2014 transitions. [2019-09-08 12:42:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:31,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:31,942 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:42:31,942 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -800294209, now seen corresponding path program 1 times [2019-09-08 12:42:31,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:32,293 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:42:32,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:32,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:32,294 INFO L87 Difference]: Start difference. First operand 1527 states and 2014 transitions. Second operand 9 states. [2019-09-08 12:42:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:35,634 INFO L93 Difference]: Finished difference Result 2736 states and 3651 transitions. [2019-09-08 12:42:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:35,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:35,637 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:42:35,637 INFO L226 Difference]: Without dead ends: 2556 [2019-09-08 12:42:35,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-09-08 12:42:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1527. [2019-09-08 12:42:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2012 transitions. [2019-09-08 12:42:35,942 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2012 transitions. Word has length 122 [2019-09-08 12:42:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:35,942 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2012 transitions. [2019-09-08 12:42:35,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2012 transitions. [2019-09-08 12:42:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:35,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:35,944 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:42:35,944 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 735327647, now seen corresponding path program 1 times [2019-09-08 12:42:35,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:36,243 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:42:36,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:36,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:36,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:36,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:36,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:36,244 INFO L87 Difference]: Start difference. First operand 1527 states and 2012 transitions. Second operand 9 states. [2019-09-08 12:42:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:39,981 INFO L93 Difference]: Finished difference Result 3010 states and 4063 transitions. [2019-09-08 12:42:39,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:39,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:39,984 INFO L225 Difference]: With dead ends: 3010 [2019-09-08 12:42:39,984 INFO L226 Difference]: Without dead ends: 2696 [2019-09-08 12:42:39,985 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:42:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-09-08 12:42:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 1527. [2019-09-08 12:42:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2010 transitions. [2019-09-08 12:42:40,295 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2010 transitions. Word has length 122 [2019-09-08 12:42:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:40,296 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2010 transitions. [2019-09-08 12:42:40,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2010 transitions. [2019-09-08 12:42:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:40,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:40,297 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:42:40,297 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash 375676223, now seen corresponding path program 1 times [2019-09-08 12:42:40,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:40,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:40,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:40,581 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:42:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:40,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:40,583 INFO L87 Difference]: Start difference. First operand 1527 states and 2010 transitions. Second operand 9 states. [2019-09-08 12:42:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:44,212 INFO L93 Difference]: Finished difference Result 2655 states and 3545 transitions. [2019-09-08 12:42:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:44,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:44,215 INFO L225 Difference]: With dead ends: 2655 [2019-09-08 12:42:44,215 INFO L226 Difference]: Without dead ends: 2636 [2019-09-08 12:42:44,216 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:42:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-09-08 12:42:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1527. [2019-09-08 12:42:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2008 transitions. [2019-09-08 12:42:44,530 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2008 transitions. Word has length 122 [2019-09-08 12:42:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:44,530 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2008 transitions. [2019-09-08 12:42:44,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2008 transitions. [2019-09-08 12:42:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:44,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:44,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,532 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1112977505, now seen corresponding path program 1 times [2019-09-08 12:42:44,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:44,830 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:42:44,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:44,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:44,831 INFO L87 Difference]: Start difference. First operand 1527 states and 2008 transitions. Second operand 9 states. [2019-09-08 12:42:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:48,551 INFO L93 Difference]: Finished difference Result 2895 states and 3898 transitions. [2019-09-08 12:42:48,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:48,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:48,555 INFO L225 Difference]: With dead ends: 2895 [2019-09-08 12:42:48,555 INFO L226 Difference]: Without dead ends: 2676 [2019-09-08 12:42:48,556 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:42:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-09-08 12:42:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1527. [2019-09-08 12:42:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2006 transitions. [2019-09-08 12:42:48,941 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2006 transitions. Word has length 122 [2019-09-08 12:42:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:48,941 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2006 transitions. [2019-09-08 12:42:48,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2006 transitions. [2019-09-08 12:42:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:48,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:48,942 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:42:48,943 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2118930561, now seen corresponding path program 1 times [2019-09-08 12:42:48,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:48,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:49,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:49,202 INFO L87 Difference]: Start difference. First operand 1527 states and 2006 transitions. Second operand 9 states. [2019-09-08 12:42:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:52,411 INFO L93 Difference]: Finished difference Result 2562 states and 3383 transitions. [2019-09-08 12:42:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:52,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:52,414 INFO L225 Difference]: With dead ends: 2562 [2019-09-08 12:42:52,414 INFO L226 Difference]: Without dead ends: 2556 [2019-09-08 12:42:52,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-09-08 12:42:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1527. [2019-09-08 12:42:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-08 12:42:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2004 transitions. [2019-09-08 12:42:52,737 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2004 transitions. Word has length 122 [2019-09-08 12:42:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:52,737 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2004 transitions. [2019-09-08 12:42:52,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2004 transitions. [2019-09-08 12:42:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:52,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:52,739 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:42:52,739 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 846547011, now seen corresponding path program 1 times [2019-09-08 12:42:52,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:52,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:53,109 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:42:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:53,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:53,111 INFO L87 Difference]: Start difference. First operand 1527 states and 2004 transitions. Second operand 9 states. [2019-09-08 12:42:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:56,508 INFO L93 Difference]: Finished difference Result 2726 states and 3626 transitions. [2019-09-08 12:42:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:56,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:42:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:56,510 INFO L225 Difference]: With dead ends: 2726 [2019-09-08 12:42:56,510 INFO L226 Difference]: Without dead ends: 2554 [2019-09-08 12:42:56,511 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:42:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2019-09-08 12:42:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1525. [2019-09-08 12:42:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2019-09-08 12:42:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2000 transitions. [2019-09-08 12:42:56,836 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2000 transitions. Word has length 122 [2019-09-08 12:42:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:56,836 INFO L475 AbstractCegarLoop]: Abstraction has 1525 states and 2000 transitions. [2019-09-08 12:42:56,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2000 transitions. [2019-09-08 12:42:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:56,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:56,837 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:42:56,838 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -354858205, now seen corresponding path program 1 times [2019-09-08 12:42:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:57,112 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:42:57,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:57,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:57,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:57,113 INFO L87 Difference]: Start difference. First operand 1525 states and 2000 transitions. Second operand 9 states. [2019-09-08 12:43:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:00,618 INFO L93 Difference]: Finished difference Result 2724 states and 3622 transitions. [2019-09-08 12:43:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:00,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:43:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:00,622 INFO L225 Difference]: With dead ends: 2724 [2019-09-08 12:43:00,622 INFO L226 Difference]: Without dead ends: 2552 [2019-09-08 12:43:00,623 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:43:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-09-08 12:43:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1523. [2019-09-08 12:43:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-09-08 12:43:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1996 transitions. [2019-09-08 12:43:00,957 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1996 transitions. Word has length 122 [2019-09-08 12:43:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:00,957 INFO L475 AbstractCegarLoop]: Abstraction has 1523 states and 1996 transitions. [2019-09-08 12:43:00,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1996 transitions. [2019-09-08 12:43:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:43:00,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:00,959 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:43:00,959 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:00,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash -594944765, now seen corresponding path program 1 times [2019-09-08 12:43:00,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:00,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:01,287 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:43:01,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:01,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:01,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:01,289 INFO L87 Difference]: Start difference. First operand 1523 states and 1996 transitions. Second operand 9 states. [2019-09-08 12:43:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:04,927 INFO L93 Difference]: Finished difference Result 2722 states and 3618 transitions. [2019-09-08 12:43:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:04,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:43:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:04,931 INFO L225 Difference]: With dead ends: 2722 [2019-09-08 12:43:04,931 INFO L226 Difference]: Without dead ends: 2550 [2019-09-08 12:43:04,933 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:43:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-09-08 12:43:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 1521. [2019-09-08 12:43:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-09-08 12:43:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1992 transitions. [2019-09-08 12:43:05,268 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1992 transitions. Word has length 122 [2019-09-08 12:43:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:05,268 INFO L475 AbstractCegarLoop]: Abstraction has 1521 states and 1992 transitions. [2019-09-08 12:43:05,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1992 transitions. [2019-09-08 12:43:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:43:05,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:05,269 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:43:05,270 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1366680803, now seen corresponding path program 1 times [2019-09-08 12:43:05,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:05,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:05,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:05,519 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:43:05,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:05,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:05,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:05,521 INFO L87 Difference]: Start difference. First operand 1521 states and 1992 transitions. Second operand 9 states. [2019-09-08 12:43:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:09,047 INFO L93 Difference]: Finished difference Result 2718 states and 3612 transitions. [2019-09-08 12:43:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:09,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-08 12:43:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:09,050 INFO L225 Difference]: With dead ends: 2718 [2019-09-08 12:43:09,050 INFO L226 Difference]: Without dead ends: 2546 [2019-09-08 12:43:09,051 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:43:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-09-08 12:43:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1519. [2019-09-08 12:43:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-09-08 12:43:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1988 transitions. [2019-09-08 12:43:09,391 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1988 transitions. Word has length 122 [2019-09-08 12:43:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:09,391 INFO L475 AbstractCegarLoop]: Abstraction has 1519 states and 1988 transitions. [2019-09-08 12:43:09,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1988 transitions. [2019-09-08 12:43:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:43:09,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:09,393 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:43:09,393 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1203155243, now seen corresponding path program 1 times [2019-09-08 12:43:09,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:09,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:10,541 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:43:11,007 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:43:11,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:11,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:43:11,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:43:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:43:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:43:11,008 INFO L87 Difference]: Start difference. First operand 1519 states and 1988 transitions. Second operand 21 states. [2019-09-08 12:43:12,160 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 12:43:12,529 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 12:43:12,718 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:43:12,890 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:43:13,068 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 12:43:13,413 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-08 12:43:13,906 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:43:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:22,683 INFO L93 Difference]: Finished difference Result 3699 states and 4861 transitions. [2019-09-08 12:43:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:43:22,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-08 12:43:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:22,686 INFO L225 Difference]: With dead ends: 3699 [2019-09-08 12:43:22,686 INFO L226 Difference]: Without dead ends: 3528 [2019-09-08 12:43:22,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=357, Invalid=1125, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:43:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-09-08 12:43:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 1519. [2019-09-08 12:43:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-09-08 12:43:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1986 transitions. [2019-09-08 12:43:23,086 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1986 transitions. Word has length 122 [2019-09-08 12:43:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:23,087 INFO L475 AbstractCegarLoop]: Abstraction has 1519 states and 1986 transitions. [2019-09-08 12:43:23,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:43:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1986 transitions. [2019-09-08 12:43:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:23,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:23,088 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] [2019-09-08 12:43:23,088 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 610152284, now seen corresponding path program 1 times [2019-09-08 12:43:23,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:23,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:23,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:23,991 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:43:23,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:23,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:43:23,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:43:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:43:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:43:23,993 INFO L87 Difference]: Start difference. First operand 1519 states and 1986 transitions. Second operand 15 states. [2019-09-08 12:43:24,723 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-08 12:43:24,864 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-08 12:43:24,994 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-08 12:43:25,151 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-08 12:43:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:29,338 INFO L93 Difference]: Finished difference Result 4704 states and 6484 transitions. [2019-09-08 12:43:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:43:29,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2019-09-08 12:43:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:29,343 INFO L225 Difference]: With dead ends: 4704 [2019-09-08 12:43:29,343 INFO L226 Difference]: Without dead ends: 4426 [2019-09-08 12:43:29,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:43:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2019-09-08 12:43:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 1411. [2019-09-08 12:43:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1840 transitions. [2019-09-08 12:43:29,734 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1840 transitions. Word has length 123 [2019-09-08 12:43:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:29,734 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1840 transitions. [2019-09-08 12:43:29,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:43:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1840 transitions. [2019-09-08 12:43:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:29,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:29,735 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] [2019-09-08 12:43:29,736 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2142390268, now seen corresponding path program 1 times [2019-09-08 12:43:29,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:29,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:30,977 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:43:30,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:43:30,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:43:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:43:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:43:30,979 INFO L87 Difference]: Start difference. First operand 1411 states and 1840 transitions. Second operand 17 states. [2019-09-08 12:43:31,774 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:43:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:37,338 INFO L93 Difference]: Finished difference Result 2845 states and 3786 transitions. [2019-09-08 12:43:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:43:37,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2019-09-08 12:43:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:37,343 INFO L225 Difference]: With dead ends: 2845 [2019-09-08 12:43:37,343 INFO L226 Difference]: Without dead ends: 2674 [2019-09-08 12:43:37,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:43:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-09-08 12:43:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1411. [2019-09-08 12:43:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1838 transitions. [2019-09-08 12:43:37,808 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1838 transitions. Word has length 123 [2019-09-08 12:43:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:37,808 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1838 transitions. [2019-09-08 12:43:37,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:43:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1838 transitions. [2019-09-08 12:43:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:37,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:37,810 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] [2019-09-08 12:43:37,810 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1464540668, now seen corresponding path program 1 times [2019-09-08 12:43:37,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:38,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:43:38,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:38,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:38,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:38,191 INFO L87 Difference]: Start difference. First operand 1411 states and 1838 transitions. Second operand 9 states. [2019-09-08 12:43:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:41,429 INFO L93 Difference]: Finished difference Result 2568 states and 3406 transitions. [2019-09-08 12:43:41,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:41,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:43:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:41,432 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:43:41,432 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:43:41,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:43:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:43:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1836 transitions. [2019-09-08 12:43:41,821 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1836 transitions. Word has length 123 [2019-09-08 12:43:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:41,822 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1836 transitions. [2019-09-08 12:43:41,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1836 transitions. [2019-09-08 12:43:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:41,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:41,823 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] [2019-09-08 12:43:41,823 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894972, now seen corresponding path program 1 times [2019-09-08 12:43:41,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:41,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:41,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:42,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:42,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:42,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:42,124 INFO L87 Difference]: Start difference. First operand 1411 states and 1836 transitions. Second operand 9 states. [2019-09-08 12:43:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:45,645 INFO L93 Difference]: Finished difference Result 2660 states and 3558 transitions. [2019-09-08 12:43:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:45,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:43:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:45,648 INFO L225 Difference]: With dead ends: 2660 [2019-09-08 12:43:45,648 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:43:45,649 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:43:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:43:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:43:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1834 transitions. [2019-09-08 12:43:46,041 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1834 transitions. Word has length 123 [2019-09-08 12:43:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:46,041 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1834 transitions. [2019-09-08 12:43:46,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1834 transitions. [2019-09-08 12:43:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:46,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:46,043 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] [2019-09-08 12:43:46,043 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 512953916, now seen corresponding path program 1 times [2019-09-08 12:43:46,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:46,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:46,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:46,285 INFO L87 Difference]: Start difference. First operand 1411 states and 1834 transitions. Second operand 9 states. [2019-09-08 12:43:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:49,784 INFO L93 Difference]: Finished difference Result 2660 states and 3556 transitions. [2019-09-08 12:43:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:49,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:43:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:49,786 INFO L225 Difference]: With dead ends: 2660 [2019-09-08 12:43:49,786 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:43:49,787 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:43:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:43:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:43:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1832 transitions. [2019-09-08 12:43:50,181 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1832 transitions. Word has length 123 [2019-09-08 12:43:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:50,181 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1832 transitions. [2019-09-08 12:43:50,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1832 transitions. [2019-09-08 12:43:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:50,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:50,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,183 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 725577756, now seen corresponding path program 1 times [2019-09-08 12:43:50,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:50,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:50,429 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:43:50,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:50,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:50,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:50,431 INFO L87 Difference]: Start difference. First operand 1411 states and 1832 transitions. Second operand 9 states. [2019-09-08 12:43:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:53,845 INFO L93 Difference]: Finished difference Result 2660 states and 3554 transitions. [2019-09-08 12:43:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:53,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:43:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:53,848 INFO L225 Difference]: With dead ends: 2660 [2019-09-08 12:43:53,848 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:43:53,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:43:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:43:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:43:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1830 transitions. [2019-09-08 12:43:54,281 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1830 transitions. Word has length 123 [2019-09-08 12:43:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:54,281 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1830 transitions. [2019-09-08 12:43:54,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1830 transitions. [2019-09-08 12:43:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:54,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:54,283 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] [2019-09-08 12:43:54,283 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash 723223452, now seen corresponding path program 1 times [2019-09-08 12:43:54,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:54,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:54,531 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:43:54,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:54,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:54,532 INFO L87 Difference]: Start difference. First operand 1411 states and 1830 transitions. Second operand 9 states. [2019-09-08 12:43:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:57,537 INFO L93 Difference]: Finished difference Result 2568 states and 3398 transitions. [2019-09-08 12:43:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:57,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:43:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:57,540 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:43:57,540 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:43:57,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:43:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:43:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:43:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1828 transitions. [2019-09-08 12:43:57,954 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1828 transitions. Word has length 123 [2019-09-08 12:43:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:57,954 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1828 transitions. [2019-09-08 12:43:57,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1828 transitions. [2019-09-08 12:43:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:43:57,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:57,956 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] [2019-09-08 12:43:57,956 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1484213154, now seen corresponding path program 1 times [2019-09-08 12:43:57,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:57,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:58,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:58,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:58,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:58,208 INFO L87 Difference]: Start difference. First operand 1411 states and 1828 transitions. Second operand 9 states. [2019-09-08 12:44:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:01,527 INFO L93 Difference]: Finished difference Result 2564 states and 3392 transitions. [2019-09-08 12:44:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:01,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:01,530 INFO L225 Difference]: With dead ends: 2564 [2019-09-08 12:44:01,530 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:01,531 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:44:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1826 transitions. [2019-09-08 12:44:02,006 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1826 transitions. Word has length 123 [2019-09-08 12:44:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:02,007 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1826 transitions. [2019-09-08 12:44:02,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1826 transitions. [2019-09-08 12:44:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:02,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:02,009 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] [2019-09-08 12:44:02,009 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash 351435036, now seen corresponding path program 1 times [2019-09-08 12:44:02,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:02,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:02,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:44:02,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:02,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:02,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:02,264 INFO L87 Difference]: Start difference. First operand 1411 states and 1826 transitions. Second operand 9 states. [2019-09-08 12:44:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:05,916 INFO L93 Difference]: Finished difference Result 2654 states and 3537 transitions. [2019-09-08 12:44:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:05,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:05,919 INFO L225 Difference]: With dead ends: 2654 [2019-09-08 12:44:05,919 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:44:05,921 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:44:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:44:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:44:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1824 transitions. [2019-09-08 12:44:06,351 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1824 transitions. Word has length 123 [2019-09-08 12:44:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:06,351 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1824 transitions. [2019-09-08 12:44:06,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1824 transitions. [2019-09-08 12:44:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:06,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:06,353 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] [2019-09-08 12:44:06,353 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1840849116, now seen corresponding path program 1 times [2019-09-08 12:44:06,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:06,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:06,630 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:44:06,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:06,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:06,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:06,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:06,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:06,632 INFO L87 Difference]: Start difference. First operand 1411 states and 1824 transitions. Second operand 9 states. [2019-09-08 12:44:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:09,791 INFO L93 Difference]: Finished difference Result 2568 states and 3392 transitions. [2019-09-08 12:44:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:09,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:09,794 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:44:09,794 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:09,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1822 transitions. [2019-09-08 12:44:10,209 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1822 transitions. Word has length 123 [2019-09-08 12:44:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:10,209 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1822 transitions. [2019-09-08 12:44:10,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1822 transitions. [2019-09-08 12:44:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:10,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:10,211 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] [2019-09-08 12:44:10,211 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash -748786468, now seen corresponding path program 1 times [2019-09-08 12:44:10,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:10,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:10,492 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:44:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:10,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:10,493 INFO L87 Difference]: Start difference. First operand 1411 states and 1822 transitions. Second operand 9 states. [2019-09-08 12:44:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:13,808 INFO L93 Difference]: Finished difference Result 2655 states and 3533 transitions. [2019-09-08 12:44:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:13,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:13,812 INFO L225 Difference]: With dead ends: 2655 [2019-09-08 12:44:13,812 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:44:13,813 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:44:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:44:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:44:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1820 transitions. [2019-09-08 12:44:14,231 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1820 transitions. Word has length 123 [2019-09-08 12:44:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:14,231 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1820 transitions. [2019-09-08 12:44:14,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1820 transitions. [2019-09-08 12:44:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:14,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:14,232 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] [2019-09-08 12:44:14,232 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1652539044, now seen corresponding path program 1 times [2019-09-08 12:44:14,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:14,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:14,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:14,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:14,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:44:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:14,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:14,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:14,478 INFO L87 Difference]: Start difference. First operand 1411 states and 1820 transitions. Second operand 9 states. [2019-09-08 12:44:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:18,259 INFO L93 Difference]: Finished difference Result 2655 states and 3531 transitions. [2019-09-08 12:44:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:18,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:18,262 INFO L225 Difference]: With dead ends: 2655 [2019-09-08 12:44:18,262 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:44:18,263 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:44:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:44:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:44:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1818 transitions. [2019-09-08 12:44:18,689 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1818 transitions. Word has length 123 [2019-09-08 12:44:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:18,689 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1818 transitions. [2019-09-08 12:44:18,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1818 transitions. [2019-09-08 12:44:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:18,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:18,690 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] [2019-09-08 12:44:18,691 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash 404740092, now seen corresponding path program 1 times [2019-09-08 12:44:18,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:18,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:18,935 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:44:18,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:18,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:18,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:18,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:18,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:18,937 INFO L87 Difference]: Start difference. First operand 1411 states and 1818 transitions. Second operand 9 states. [2019-09-08 12:44:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:22,644 INFO L93 Difference]: Finished difference Result 2568 states and 3386 transitions. [2019-09-08 12:44:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:22,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:22,647 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:44:22,647 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:22,648 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:44:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1816 transitions. [2019-09-08 12:44:23,071 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1816 transitions. Word has length 123 [2019-09-08 12:44:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:23,071 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1816 transitions. [2019-09-08 12:44:23,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1816 transitions. [2019-09-08 12:44:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:23,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:23,073 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] [2019-09-08 12:44:23,073 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1162964388, now seen corresponding path program 1 times [2019-09-08 12:44:23,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:23,319 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:44:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:23,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:23,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:23,320 INFO L87 Difference]: Start difference. First operand 1411 states and 1816 transitions. Second operand 9 states. [2019-09-08 12:44:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:26,812 INFO L93 Difference]: Finished difference Result 2568 states and 3382 transitions. [2019-09-08 12:44:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:26,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:26,816 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:44:26,816 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:26,817 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:44:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1814 transitions. [2019-09-08 12:44:27,249 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1814 transitions. Word has length 123 [2019-09-08 12:44:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:27,249 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1814 transitions. [2019-09-08 12:44:27,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1814 transitions. [2019-09-08 12:44:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:27,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,251 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1074723772, now seen corresponding path program 1 times [2019-09-08 12:44:27,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:27,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:27,487 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:44:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:27,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:27,488 INFO L87 Difference]: Start difference. First operand 1411 states and 1814 transitions. Second operand 9 states. [2019-09-08 12:44:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:31,000 INFO L93 Difference]: Finished difference Result 2655 states and 3523 transitions. [2019-09-08 12:44:31,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:31,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:31,004 INFO L225 Difference]: With dead ends: 2655 [2019-09-08 12:44:31,004 INFO L226 Difference]: Without dead ends: 2464 [2019-09-08 12:44:31,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-08 12:44:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-08 12:44:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1812 transitions. [2019-09-08 12:44:31,438 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1812 transitions. Word has length 123 [2019-09-08 12:44:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:31,439 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1812 transitions. [2019-09-08 12:44:31,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1812 transitions. [2019-09-08 12:44:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:31,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:31,440 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] [2019-09-08 12:44:31,440 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -630607940, now seen corresponding path program 1 times [2019-09-08 12:44:31,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:31,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:31,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:31,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:31,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:31,689 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:44:31,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:31,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:31,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:31,690 INFO L87 Difference]: Start difference. First operand 1411 states and 1812 transitions. Second operand 9 states. [2019-09-08 12:44:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:35,002 INFO L93 Difference]: Finished difference Result 2568 states and 3376 transitions. [2019-09-08 12:44:35,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:35,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:35,004 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:44:35,005 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:35,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1810 transitions. [2019-09-08 12:44:35,491 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1810 transitions. Word has length 123 [2019-09-08 12:44:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:35,491 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1810 transitions. [2019-09-08 12:44:35,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1810 transitions. [2019-09-08 12:44:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:35,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:35,493 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] [2019-09-08 12:44:35,493 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1237976956, now seen corresponding path program 1 times [2019-09-08 12:44:35,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:35,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:35,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:35,734 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:44:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:35,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:35,735 INFO L87 Difference]: Start difference. First operand 1411 states and 1810 transitions. Second operand 9 states. [2019-09-08 12:44:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:39,120 INFO L93 Difference]: Finished difference Result 2568 states and 3374 transitions. [2019-09-08 12:44:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:39,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 12:44:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:39,124 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 12:44:39,124 INFO L226 Difference]: Without dead ends: 2392 [2019-09-08 12:44:39,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-08 12:44:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-08 12:44:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:44:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1808 transitions. [2019-09-08 12:44:39,644 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1808 transitions. Word has length 123 [2019-09-08 12:44:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1808 transitions. [2019-09-08 12:44:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1808 transitions. [2019-09-08 12:44:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:44:39,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:39,646 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] [2019-09-08 12:44:39,646 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 106319961, now seen corresponding path program 1 times [2019-09-08 12:44:39,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:40,248 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:44:40,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:40,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:44:40,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:44:40,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:44:40,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:44:40,249 INFO L87 Difference]: Start difference. First operand 1411 states and 1808 transitions. Second operand 13 states. [2019-09-08 12:44:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:42,613 INFO L93 Difference]: Finished difference Result 2359 states and 3109 transitions. [2019-09-08 12:44:42,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:42,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-08 12:44:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:42,615 INFO L225 Difference]: With dead ends: 2359 [2019-09-08 12:44:42,616 INFO L226 Difference]: Without dead ends: 1942 [2019-09-08 12:44:42,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:44:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-09-08 12:44:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1212. [2019-09-08 12:44:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:44:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1549 transitions. [2019-09-08 12:44:43,018 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1549 transitions. Word has length 123 [2019-09-08 12:44:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:43,018 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1549 transitions. [2019-09-08 12:44:43,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:44:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1549 transitions. [2019-09-08 12:44:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:44:43,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:43,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,020 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1902905422, now seen corresponding path program 1 times [2019-09-08 12:44:43,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:43,266 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:44:43,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:43,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:43,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:43,267 INFO L87 Difference]: Start difference. First operand 1212 states and 1549 transitions. Second operand 9 states. [2019-09-08 12:44:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:46,535 INFO L93 Difference]: Finished difference Result 2300 states and 3028 transitions. [2019-09-08 12:44:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:46,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:44:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:46,538 INFO L225 Difference]: With dead ends: 2300 [2019-09-08 12:44:46,538 INFO L226 Difference]: Without dead ends: 2127 [2019-09-08 12:44:46,539 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:44:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-08 12:44:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-08 12:44:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:44:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1548 transitions. [2019-09-08 12:44:46,948 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1548 transitions. Word has length 124 [2019-09-08 12:44:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:46,948 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1548 transitions. [2019-09-08 12:44:46,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1548 transitions. [2019-09-08 12:44:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:44:46,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:46,949 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:44:46,949 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1770593266, now seen corresponding path program 1 times [2019-09-08 12:44:46,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:46,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:47,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:44:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:47,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:47,264 INFO L87 Difference]: Start difference. First operand 1212 states and 1548 transitions. Second operand 9 states. [2019-09-08 12:44:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:50,986 INFO L93 Difference]: Finished difference Result 2367 states and 3138 transitions. [2019-09-08 12:44:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:50,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:44:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:50,988 INFO L225 Difference]: With dead ends: 2367 [2019-09-08 12:44:50,988 INFO L226 Difference]: Without dead ends: 2183 [2019-09-08 12:44:50,989 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:44:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-09-08 12:44:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1212. [2019-09-08 12:44:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:44:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1547 transitions. [2019-09-08 12:44:51,399 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1547 transitions. Word has length 124 [2019-09-08 12:44:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:51,400 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1547 transitions. [2019-09-08 12:44:51,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1547 transitions. [2019-09-08 12:44:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:44:51,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:51,401 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:44:51,401 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 232203662, now seen corresponding path program 1 times [2019-09-08 12:44:51,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:51,663 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:44:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:51,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:51,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:51,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:51,664 INFO L87 Difference]: Start difference. First operand 1212 states and 1547 transitions. Second operand 9 states. [2019-09-08 12:44:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:55,140 INFO L93 Difference]: Finished difference Result 2367 states and 3137 transitions. [2019-09-08 12:44:55,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:55,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:44:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:55,143 INFO L225 Difference]: With dead ends: 2367 [2019-09-08 12:44:55,143 INFO L226 Difference]: Without dead ends: 2183 [2019-09-08 12:44:55,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-09-08 12:44:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1212. [2019-09-08 12:44:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:44:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1546 transitions. [2019-09-08 12:44:55,594 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1546 transitions. Word has length 124 [2019-09-08 12:44:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:55,595 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1546 transitions. [2019-09-08 12:44:55,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1546 transitions. [2019-09-08 12:44:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:44:55,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:55,596 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:44:55,596 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1645493938, now seen corresponding path program 1 times [2019-09-08 12:44:55,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:55,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:55,860 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:44:55,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:55,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:55,861 INFO L87 Difference]: Start difference. First operand 1212 states and 1546 transitions. Second operand 9 states. [2019-09-08 12:44:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:59,316 INFO L93 Difference]: Finished difference Result 2300 states and 3025 transitions. [2019-09-08 12:44:59,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:59,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:44:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:59,319 INFO L225 Difference]: With dead ends: 2300 [2019-09-08 12:44:59,319 INFO L226 Difference]: Without dead ends: 2127 [2019-09-08 12:44:59,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-08 12:44:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-08 12:44:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:44:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1545 transitions. [2019-09-08 12:44:59,732 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1545 transitions. Word has length 124 [2019-09-08 12:44:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:59,733 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1545 transitions. [2019-09-08 12:44:59,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1545 transitions. [2019-09-08 12:44:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:44:59,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:59,734 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:44:59,734 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1545649006, now seen corresponding path program 1 times [2019-09-08 12:44:59,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:59,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:59,982 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:44:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:59,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:59,983 INFO L87 Difference]: Start difference. First operand 1212 states and 1545 transitions. Second operand 9 states. [2019-09-08 12:45:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:03,555 INFO L93 Difference]: Finished difference Result 2300 states and 3024 transitions. [2019-09-08 12:45:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:03,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:03,558 INFO L225 Difference]: With dead ends: 2300 [2019-09-08 12:45:03,558 INFO L226 Difference]: Without dead ends: 2127 [2019-09-08 12:45:03,559 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:45:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-08 12:45:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-08 12:45:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:45:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1544 transitions. [2019-09-08 12:45:03,970 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1544 transitions. Word has length 124 [2019-09-08 12:45:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:03,971 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1544 transitions. [2019-09-08 12:45:03,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1544 transitions. [2019-09-08 12:45:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:03,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:03,972 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:45:03,972 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 822278960, now seen corresponding path program 1 times [2019-09-08 12:45:03,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:04,210 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:45:04,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:04,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:04,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:04,211 INFO L87 Difference]: Start difference. First operand 1212 states and 1544 transitions. Second operand 9 states. [2019-09-08 12:45:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:07,623 INFO L93 Difference]: Finished difference Result 2298 states and 3020 transitions. [2019-09-08 12:45:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:07,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:07,626 INFO L225 Difference]: With dead ends: 2298 [2019-09-08 12:45:07,626 INFO L226 Difference]: Without dead ends: 2127 [2019-09-08 12:45:07,627 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:45:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-08 12:45:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-08 12:45:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 12:45:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1543 transitions. [2019-09-08 12:45:08,047 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1543 transitions. Word has length 124 [2019-09-08 12:45:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:08,048 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1543 transitions. [2019-09-08 12:45:08,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1543 transitions. [2019-09-08 12:45:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:08,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:08,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,049 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 739015698, now seen corresponding path program 1 times [2019-09-08 12:45:08,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:08,774 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:45:08,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:08,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:45:08,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:45:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:45:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:45:08,776 INFO L87 Difference]: Start difference. First operand 1212 states and 1543 transitions. Second operand 15 states. [2019-09-08 12:45:09,435 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 12:45:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:12,001 INFO L93 Difference]: Finished difference Result 2156 states and 2842 transitions. [2019-09-08 12:45:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:45:12,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2019-09-08 12:45:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:12,003 INFO L225 Difference]: With dead ends: 2156 [2019-09-08 12:45:12,003 INFO L226 Difference]: Without dead ends: 1739 [2019-09-08 12:45:12,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:45:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2019-09-08 12:45:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 965. [2019-09-08 12:45:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1239 transitions. [2019-09-08 12:45:12,358 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1239 transitions. Word has length 124 [2019-09-08 12:45:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:12,358 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1239 transitions. [2019-09-08 12:45:12,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:45:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1239 transitions. [2019-09-08 12:45:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:12,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:12,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:12,359 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash -965884732, now seen corresponding path program 1 times [2019-09-08 12:45:12,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:12,744 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:45:12,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:12,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:12,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:12,746 INFO L87 Difference]: Start difference. First operand 965 states and 1239 transitions. Second operand 9 states. [2019-09-08 12:45:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:15,521 INFO L93 Difference]: Finished difference Result 2010 states and 2700 transitions. [2019-09-08 12:45:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:15,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:15,524 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 12:45:15,524 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:45:15,525 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:45:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:45:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-08 12:45:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1237 transitions. [2019-09-08 12:45:15,884 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1237 transitions. Word has length 124 [2019-09-08 12:45:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:15,884 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1237 transitions. [2019-09-08 12:45:15,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1237 transitions. [2019-09-08 12:45:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:15,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,886 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash -819468636, now seen corresponding path program 1 times [2019-09-08 12:45:15,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:15,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:16,225 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:45:16,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:16,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:16,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:16,226 INFO L87 Difference]: Start difference. First operand 965 states and 1237 transitions. Second operand 9 states. [2019-09-08 12:45:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:19,070 INFO L93 Difference]: Finished difference Result 1953 states and 2604 transitions. [2019-09-08 12:45:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:19,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:19,072 INFO L225 Difference]: With dead ends: 1953 [2019-09-08 12:45:19,073 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:45:19,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:45:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-08 12:45:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1235 transitions. [2019-09-08 12:45:19,440 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1235 transitions. Word has length 124 [2019-09-08 12:45:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:19,440 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1235 transitions. [2019-09-08 12:45:19,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1235 transitions. [2019-09-08 12:45:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:19,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:19,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,441 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash -382534300, now seen corresponding path program 1 times [2019-09-08 12:45:19,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:19,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:19,695 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:45:19,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:19,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:19,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:19,696 INFO L87 Difference]: Start difference. First operand 965 states and 1235 transitions. Second operand 9 states. [2019-09-08 12:45:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:22,532 INFO L93 Difference]: Finished difference Result 2074 states and 2779 transitions. [2019-09-08 12:45:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:22,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:22,535 INFO L225 Difference]: With dead ends: 2074 [2019-09-08 12:45:22,535 INFO L226 Difference]: Without dead ends: 1833 [2019-09-08 12:45:22,535 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:45:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-09-08 12:45:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 965. [2019-09-08 12:45:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1233 transitions. [2019-09-08 12:45:22,937 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1233 transitions. Word has length 124 [2019-09-08 12:45:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:22,938 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1233 transitions. [2019-09-08 12:45:22,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1233 transitions. [2019-09-08 12:45:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:22,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:22,939 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:45:22,939 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash -446756188, now seen corresponding path program 1 times [2019-09-08 12:45:22,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:23,186 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:45:23,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:23,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:23,187 INFO L87 Difference]: Start difference. First operand 965 states and 1233 transitions. Second operand 9 states. [2019-09-08 12:45:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:26,051 INFO L93 Difference]: Finished difference Result 2010 states and 2694 transitions. [2019-09-08 12:45:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:26,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:26,053 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 12:45:26,053 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:45:26,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:45:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-08 12:45:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1231 transitions. [2019-09-08 12:45:26,420 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1231 transitions. Word has length 124 [2019-09-08 12:45:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:26,421 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1231 transitions. [2019-09-08 12:45:26,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1231 transitions. [2019-09-08 12:45:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:26,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:26,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,422 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -300340092, now seen corresponding path program 1 times [2019-09-08 12:45:26,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:26,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:26,685 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:45:26,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:26,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:26,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:26,686 INFO L87 Difference]: Start difference. First operand 965 states and 1231 transitions. Second operand 9 states. [2019-09-08 12:45:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:29,545 INFO L93 Difference]: Finished difference Result 1953 states and 2598 transitions. [2019-09-08 12:45:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:29,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:29,547 INFO L225 Difference]: With dead ends: 1953 [2019-09-08 12:45:29,547 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:45:29,548 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:45:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:45:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-08 12:45:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1229 transitions. [2019-09-08 12:45:29,916 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1229 transitions. Word has length 124 [2019-09-08 12:45:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:29,917 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1229 transitions. [2019-09-08 12:45:29,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1229 transitions. [2019-09-08 12:45:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:29,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:29,918 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:45:29,918 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 117914884, now seen corresponding path program 1 times [2019-09-08 12:45:29,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:30,160 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:45:30,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:30,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:30,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:30,161 INFO L87 Difference]: Start difference. First operand 965 states and 1229 transitions. Second operand 9 states. [2019-09-08 12:45:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:32,908 INFO L93 Difference]: Finished difference Result 1953 states and 2596 transitions. [2019-09-08 12:45:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:32,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:32,910 INFO L225 Difference]: With dead ends: 1953 [2019-09-08 12:45:32,910 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:45:32,911 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:45:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:45:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-08 12:45:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1227 transitions. [2019-09-08 12:45:33,288 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1227 transitions. Word has length 124 [2019-09-08 12:45:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:33,289 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1227 transitions. [2019-09-08 12:45:33,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1227 transitions. [2019-09-08 12:45:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:33,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:33,290 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:45:33,290 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash -28501212, now seen corresponding path program 1 times [2019-09-08 12:45:33,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:33,538 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:45:33,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:33,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:33,539 INFO L87 Difference]: Start difference. First operand 965 states and 1227 transitions. Second operand 9 states. [2019-09-08 12:45:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:36,678 INFO L93 Difference]: Finished difference Result 2010 states and 2682 transitions. [2019-09-08 12:45:36,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:36,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 12:45:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:36,680 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 12:45:36,680 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:45:36,681 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:45:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:45:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-08 12:45:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1225 transitions. [2019-09-08 12:45:37,067 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1225 transitions. Word has length 124 [2019-09-08 12:45:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:37,068 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1225 transitions. [2019-09-08 12:45:37,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1225 transitions. [2019-09-08 12:45:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:45:37,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:37,069 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:45:37,069 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash 315424146, now seen corresponding path program 1 times [2019-09-08 12:45:37,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:37,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:37,319 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:45:37,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:37,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:37,320 INFO L87 Difference]: Start difference. First operand 965 states and 1225 transitions. Second operand 9 states. [2019-09-08 12:45:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:39,940 INFO L93 Difference]: Finished difference Result 1949 states and 2587 transitions. [2019-09-08 12:45:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:39,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-08 12:45:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:39,943 INFO L225 Difference]: With dead ends: 1949 [2019-09-08 12:45:39,943 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:45:39,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:45:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-08 12:45:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1224 transitions. [2019-09-08 12:45:40,323 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1224 transitions. Word has length 125 [2019-09-08 12:45:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:40,323 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1224 transitions. [2019-09-08 12:45:40,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1224 transitions. [2019-09-08 12:45:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:45:40,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:40,324 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:45:40,324 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -773317262, now seen corresponding path program 1 times [2019-09-08 12:45:40,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:40,566 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:45:40,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:40,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:40,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:40,567 INFO L87 Difference]: Start difference. First operand 965 states and 1224 transitions. Second operand 9 states. [2019-09-08 12:45:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:43,506 INFO L93 Difference]: Finished difference Result 2002 states and 2664 transitions. [2019-09-08 12:45:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:43,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-08 12:45:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:43,508 INFO L225 Difference]: With dead ends: 2002 [2019-09-08 12:45:43,508 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:45:43,509 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:45:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:45:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-08 12:45:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 12:45:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1223 transitions. [2019-09-08 12:45:43,888 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1223 transitions. Word has length 125 [2019-09-08 12:45:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:43,889 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1223 transitions. [2019-09-08 12:45:43,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1223 transitions. [2019-09-08 12:45:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:45:43,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:43,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:43,890 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 870691223, now seen corresponding path program 1 times [2019-09-08 12:45:43,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:43,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:44,962 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:45:45,108 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:45:45,254 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:45:45,539 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:45:46,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:45:46,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:46,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:45:46,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:45:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:45:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:45:46,739 INFO L87 Difference]: Start difference. First operand 965 states and 1223 transitions. Second operand 31 states. [2019-09-08 12:45:46,960 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 12:45:48,030 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-08 12:45:48,208 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 12:45:48,834 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-08 12:45:49,149 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-08 12:45:49,532 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-09-08 12:45:49,976 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-09-08 12:45:50,557 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-09-08 12:45:50,871 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 12:45:51,162 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 12:45:51,493 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-08 12:46:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:03,516 INFO L93 Difference]: Finished difference Result 1954 states and 2602 transitions. [2019-09-08 12:46:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:46:03,516 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2019-09-08 12:46:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:03,519 INFO L225 Difference]: With dead ends: 1954 [2019-09-08 12:46:03,519 INFO L226 Difference]: Without dead ends: 1783 [2019-09-08 12:46:03,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:46:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2019-09-08 12:46:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 992. [2019-09-08 12:46:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-09-08 12:46:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1257 transitions. [2019-09-08 12:46:03,920 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1257 transitions. Word has length 125 [2019-09-08 12:46:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:03,920 INFO L475 AbstractCegarLoop]: Abstraction has 992 states and 1257 transitions. [2019-09-08 12:46:03,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:46:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1257 transitions. [2019-09-08 12:46:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:46:03,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:03,921 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:46:03,922 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -214993769, now seen corresponding path program 1 times [2019-09-08 12:46:03,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:03,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:03,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:03,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:04,993 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:46:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:04,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:04,994 INFO L87 Difference]: Start difference. First operand 992 states and 1257 transitions. Second operand 17 states. [2019-09-08 12:46:05,678 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:46:05,818 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:46:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:09,058 INFO L93 Difference]: Finished difference Result 2244 states and 2973 transitions. [2019-09-08 12:46:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:46:09,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2019-09-08 12:46:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:09,061 INFO L225 Difference]: With dead ends: 2244 [2019-09-08 12:46:09,061 INFO L226 Difference]: Without dead ends: 1957 [2019-09-08 12:46:09,061 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:46:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-09-08 12:46:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 940. [2019-09-08 12:46:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-08 12:46:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1188 transitions. [2019-09-08 12:46:09,469 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1188 transitions. Word has length 125 [2019-09-08 12:46:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:09,469 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1188 transitions. [2019-09-08 12:46:09,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:46:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1188 transitions. [2019-09-08 12:46:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:46:09,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:09,470 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:46:09,470 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -131595721, now seen corresponding path program 1 times [2019-09-08 12:46:09,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:09,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:10,770 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:46:10,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:10,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:46:10,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:46:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:46:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:10,771 INFO L87 Difference]: Start difference. First operand 940 states and 1188 transitions. Second operand 22 states. [2019-09-08 12:46:11,897 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:46:12,157 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 12:46:12,557 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:46:12,706 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:46:12,978 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:46:13,209 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:46:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:16,930 INFO L93 Difference]: Finished difference Result 2277 states and 2971 transitions. [2019-09-08 12:46:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:46:16,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-08 12:46:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:16,932 INFO L225 Difference]: With dead ends: 2277 [2019-09-08 12:46:16,932 INFO L226 Difference]: Without dead ends: 1990 [2019-09-08 12:46:16,932 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:46:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-09-08 12:46:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 954. [2019-09-08 12:46:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-09-08 12:46:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1202 transitions. [2019-09-08 12:46:17,358 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1202 transitions. Word has length 125 [2019-09-08 12:46:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:17,358 INFO L475 AbstractCegarLoop]: Abstraction has 954 states and 1202 transitions. [2019-09-08 12:46:17,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:46:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1202 transitions. [2019-09-08 12:46:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:46:17,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:17,360 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:46:17,360 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1811701961, now seen corresponding path program 1 times [2019-09-08 12:46:17,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:17,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:17,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:18,352 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:46:18,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:18,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:18,353 INFO L87 Difference]: Start difference. First operand 954 states and 1202 transitions. Second operand 17 states. [2019-09-08 12:46:19,023 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:46:19,172 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:46:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:22,007 INFO L93 Difference]: Finished difference Result 2125 states and 2814 transitions. [2019-09-08 12:46:22,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:46:22,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2019-09-08 12:46:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:22,011 INFO L225 Difference]: With dead ends: 2125 [2019-09-08 12:46:22,011 INFO L226 Difference]: Without dead ends: 1855 [2019-09-08 12:46:22,012 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:46:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-09-08 12:46:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 912. [2019-09-08 12:46:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-08 12:46:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1144 transitions. [2019-09-08 12:46:22,471 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1144 transitions. Word has length 125 [2019-09-08 12:46:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:22,471 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1144 transitions. [2019-09-08 12:46:22,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:46:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1144 transitions. [2019-09-08 12:46:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:22,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:22,473 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:46:22,473 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1343428439, now seen corresponding path program 1 times [2019-09-08 12:46:22,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:22,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:23,052 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:46:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:46:23,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:46:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:46:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:46:23,053 INFO L87 Difference]: Start difference. First operand 912 states and 1144 transitions. Second operand 12 states. [2019-09-08 12:46:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:26,656 INFO L93 Difference]: Finished difference Result 2179 states and 2944 transitions. [2019-09-08 12:46:26,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:26,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2019-09-08 12:46:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:26,659 INFO L225 Difference]: With dead ends: 2179 [2019-09-08 12:46:26,659 INFO L226 Difference]: Without dead ends: 2008 [2019-09-08 12:46:26,660 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:46:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-09-08 12:46:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 911. [2019-09-08 12:46:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-08 12:46:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1142 transitions. [2019-09-08 12:46:27,142 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1142 transitions. Word has length 126 [2019-09-08 12:46:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:27,142 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1142 transitions. [2019-09-08 12:46:27,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:46:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1142 transitions. [2019-09-08 12:46:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:27,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:27,143 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:46:27,143 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash -434459607, now seen corresponding path program 1 times [2019-09-08 12:46:27,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:27,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:27,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:27,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:28,064 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:46:28,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:28,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:28,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:28,065 INFO L87 Difference]: Start difference. First operand 911 states and 1142 transitions. Second operand 17 states. [2019-09-08 12:46:28,740 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:46:28,885 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:46:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:32,230 INFO L93 Difference]: Finished difference Result 1915 states and 2544 transitions. [2019-09-08 12:46:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:46:32,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-08 12:46:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:32,232 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:46:32,232 INFO L226 Difference]: Without dead ends: 1722 [2019-09-08 12:46:32,233 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:46:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-09-08 12:46:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 903. [2019-09-08 12:46:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-08 12:46:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1130 transitions. [2019-09-08 12:46:32,671 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1130 transitions. Word has length 126 [2019-09-08 12:46:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:32,671 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1130 transitions. [2019-09-08 12:46:32,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:46:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1130 transitions. [2019-09-08 12:46:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:32,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:32,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,672 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1958530185, now seen corresponding path program 1 times [2019-09-08 12:46:32,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:34,818 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:46:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:46:34,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:46:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:46:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:34,819 INFO L87 Difference]: Start difference. First operand 903 states and 1130 transitions. Second operand 22 states. [2019-09-08 12:46:35,952 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-08 12:46:36,221 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-08 12:46:36,563 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-09-08 12:46:36,770 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:46:37,084 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-08 12:46:37,400 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-08 12:46:37,585 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-08 12:46:37,807 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-08 12:46:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:41,426 INFO L93 Difference]: Finished difference Result 1886 states and 2462 transitions. [2019-09-08 12:46:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:46:41,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-09-08 12:46:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:41,428 INFO L225 Difference]: With dead ends: 1886 [2019-09-08 12:46:41,428 INFO L226 Difference]: Without dead ends: 1693 [2019-09-08 12:46:41,429 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:46:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-09-08 12:46:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 910. [2019-09-08 12:46:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 12:46:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1137 transitions. [2019-09-08 12:46:41,872 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1137 transitions. Word has length 126 [2019-09-08 12:46:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:41,872 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1137 transitions. [2019-09-08 12:46:41,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:46:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1137 transitions. [2019-09-08 12:46:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:41,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:41,873 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:46:41,873 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 10193769, now seen corresponding path program 1 times [2019-09-08 12:46:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:41,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:43,183 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:46:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:43,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:46:43,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:46:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:46:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:43,184 INFO L87 Difference]: Start difference. First operand 910 states and 1137 transitions. Second operand 22 states. [2019-09-08 12:46:44,315 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-08 12:46:44,599 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 12:46:44,916 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 12:46:45,109 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:46:45,435 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 12:46:45,686 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:46:45,849 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:46:46,076 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:46:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:51,310 INFO L93 Difference]: Finished difference Result 2279 states and 3017 transitions. [2019-09-08 12:46:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:46:51,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-09-08 12:46:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:51,313 INFO L225 Difference]: With dead ends: 2279 [2019-09-08 12:46:51,313 INFO L226 Difference]: Without dead ends: 2105 [2019-09-08 12:46:51,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:46:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2019-09-08 12:46:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 917. [2019-09-08 12:46:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-08 12:46:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1144 transitions. [2019-09-08 12:46:51,773 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1144 transitions. Word has length 126 [2019-09-08 12:46:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:51,773 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1144 transitions. [2019-09-08 12:46:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:46:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1144 transitions. [2019-09-08 12:46:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:51,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:51,774 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:46:51,774 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1360330293, now seen corresponding path program 1 times [2019-09-08 12:46:51,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:51,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:52,643 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:46:52,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:52,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:46:52,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:46:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:46:52,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:52,644 INFO L87 Difference]: Start difference. First operand 917 states and 1144 transitions. Second operand 17 states. [2019-09-08 12:46:53,392 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:46:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:57,198 INFO L93 Difference]: Finished difference Result 1908 states and 2524 transitions. [2019-09-08 12:46:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:46:57,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-08 12:46:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:57,200 INFO L225 Difference]: With dead ends: 1908 [2019-09-08 12:46:57,200 INFO L226 Difference]: Without dead ends: 1736 [2019-09-08 12:46:57,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:46:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2019-09-08 12:46:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 917. [2019-09-08 12:46:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-08 12:46:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1142 transitions. [2019-09-08 12:46:57,678 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1142 transitions. Word has length 126 [2019-09-08 12:46:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:57,678 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1142 transitions. [2019-09-08 12:46:57,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:46:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1142 transitions. [2019-09-08 12:46:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:57,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:57,680 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:46:57,680 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -994061552, now seen corresponding path program 1 times [2019-09-08 12:46:57,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:57,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:57,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:58,788 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:46:58,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:58,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:46:58,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:46:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:46:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:46:58,789 INFO L87 Difference]: Start difference. First operand 917 states and 1142 transitions. Second operand 15 states. [2019-09-08 12:46:58,941 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-08 12:46:59,216 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:46:59,344 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 12:46:59,494 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 12:46:59,674 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:46:59,897 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-09-08 12:47:00,142 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-08 12:47:00,393 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-08 12:47:01,075 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 12:47:01,561 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-08 12:47:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:06,491 INFO L93 Difference]: Finished difference Result 3188 states and 4338 transitions. [2019-09-08 12:47:06,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:47:06,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 126 [2019-09-08 12:47:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:06,496 INFO L225 Difference]: With dead ends: 3188 [2019-09-08 12:47:06,496 INFO L226 Difference]: Without dead ends: 2951 [2019-09-08 12:47:06,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:47:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-09-08 12:47:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 831. [2019-09-08 12:47:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-08 12:47:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1032 transitions. [2019-09-08 12:47:07,006 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1032 transitions. Word has length 126 [2019-09-08 12:47:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:07,006 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1032 transitions. [2019-09-08 12:47:07,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:47:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1032 transitions. [2019-09-08 12:47:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:47:07,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:07,007 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:47:07,007 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1306627305, now seen corresponding path program 1 times [2019-09-08 12:47:07,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:08,145 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:47:08,291 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:47:08,442 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:47:08,614 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 12:47:08,796 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:47:08,993 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:47:09,184 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:47:09,367 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:47:09,542 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:47:11,401 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:47:11,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:11,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:47:11,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:47:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:47:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:47:11,402 INFO L87 Difference]: Start difference. First operand 831 states and 1032 transitions. Second operand 36 states. [2019-09-08 12:47:11,726 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-09-08 12:47:13,058 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-09-08 12:47:13,286 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-09-08 12:47:13,534 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-08 12:47:13,789 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-09-08 12:47:14,636 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-09-08 12:47:15,118 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-09-08 12:47:15,651 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 98 [2019-09-08 12:47:16,318 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 113 [2019-09-08 12:47:17,146 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 127 [2019-09-08 12:47:18,062 WARN L188 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 146 [2019-09-08 12:47:18,517 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-09-08 12:47:18,926 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-09-08 12:47:19,192 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 12:47:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:31,431 INFO L93 Difference]: Finished difference Result 1431 states and 1833 transitions. [2019-09-08 12:47:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:47:31,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 126 [2019-09-08 12:47:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:31,433 INFO L225 Difference]: With dead ends: 1431 [2019-09-08 12:47:31,433 INFO L226 Difference]: Without dead ends: 1257 [2019-09-08 12:47:31,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 12:47:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-08 12:47:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 860. [2019-09-08 12:47:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-08 12:47:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1069 transitions. [2019-09-08 12:47:31,913 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1069 transitions. Word has length 126 [2019-09-08 12:47:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:31,913 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1069 transitions. [2019-09-08 12:47:31,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:47:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1069 transitions. [2019-09-08 12:47:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:47:31,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:31,914 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:47:31,914 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1978228488, now seen corresponding path program 1 times [2019-09-08 12:47:31,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:31,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:32,428 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:47:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:47:32,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:47:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:47:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:47:32,429 INFO L87 Difference]: Start difference. First operand 860 states and 1069 transitions. Second operand 11 states. [2019-09-08 12:47:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:36,003 INFO L93 Difference]: Finished difference Result 2610 states and 3602 transitions. [2019-09-08 12:47:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:36,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-09-08 12:47:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:36,005 INFO L225 Difference]: With dead ends: 2610 [2019-09-08 12:47:36,006 INFO L226 Difference]: Without dead ends: 2418 [2019-09-08 12:47:36,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:47:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2019-09-08 12:47:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 838. [2019-09-08 12:47:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-08 12:47:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1040 transitions. [2019-09-08 12:47:36,513 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1040 transitions. Word has length 126 [2019-09-08 12:47:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:36,514 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1040 transitions. [2019-09-08 12:47:36,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:47:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1040 transitions. [2019-09-08 12:47:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:47:36,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:36,515 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:47:36,515 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 535165735, now seen corresponding path program 1 times [2019-09-08 12:47:36,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:36,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:37,238 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:47:37,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:37,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:47:37,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:47:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:47:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:47:37,239 INFO L87 Difference]: Start difference. First operand 838 states and 1040 transitions. Second operand 13 states. [2019-09-08 12:47:37,819 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-08 12:47:37,960 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-08 12:47:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:42,278 INFO L93 Difference]: Finished difference Result 2981 states and 4081 transitions. [2019-09-08 12:47:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:47:42,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-08 12:47:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:42,283 INFO L225 Difference]: With dead ends: 2981 [2019-09-08 12:47:42,283 INFO L226 Difference]: Without dead ends: 2789 [2019-09-08 12:47:42,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:47:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2019-09-08 12:47:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 816. [2019-09-08 12:47:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-08 12:47:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1011 transitions. [2019-09-08 12:47:42,806 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1011 transitions. Word has length 126 [2019-09-08 12:47:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:42,807 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1011 transitions. [2019-09-08 12:47:42,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:47:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1011 transitions. [2019-09-08 12:47:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:47:42,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:42,808 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:47:42,808 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -899678243, now seen corresponding path program 1 times [2019-09-08 12:47:42,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:42,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:44,152 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:47:44,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:44,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:47:44,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:47:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:47:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:44,154 INFO L87 Difference]: Start difference. First operand 816 states and 1011 transitions. Second operand 21 states. [2019-09-08 12:47:44,303 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-08 12:47:45,247 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-08 12:47:45,498 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 12:47:45,676 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:47:45,844 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:47:46,027 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:47:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:50,486 INFO L93 Difference]: Finished difference Result 1682 states and 2225 transitions. [2019-09-08 12:47:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:47:50,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-08 12:47:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:50,488 INFO L225 Difference]: With dead ends: 1682 [2019-09-08 12:47:50,488 INFO L226 Difference]: Without dead ends: 1511 [2019-09-08 12:47:50,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:47:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-09-08 12:47:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 839. [2019-09-08 12:47:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-08 12:47:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1042 transitions. [2019-09-08 12:47:51,000 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1042 transitions. Word has length 126 [2019-09-08 12:47:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:51,001 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1042 transitions. [2019-09-08 12:47:51,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:47:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1042 transitions. [2019-09-08 12:47:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:47:51,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:51,001 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:47:51,002 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -480497379, now seen corresponding path program 1 times [2019-09-08 12:47:51,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:51,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:52,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:47:52,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:52,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:47:52,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:47:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:47:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:52,584 INFO L87 Difference]: Start difference. First operand 839 states and 1042 transitions. Second operand 21 states. [2019-09-08 12:47:52,823 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-08 12:47:53,316 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-08 12:47:53,496 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-09-08 12:47:53,726 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 12:47:54,133 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-08 12:47:54,428 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-09-08 12:47:54,791 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-09-08 12:47:55,198 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-09-08 12:47:55,485 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-08 12:47:55,882 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-08 12:47:56,310 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-09-08 12:47:56,949 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-08 12:47:57,428 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:47:57,707 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-08 12:47:58,255 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-08 12:47:58,617 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-08 12:47:59,112 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-08 12:48:02,541 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-08 12:48:02,951 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-08 12:48:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:04,851 INFO L93 Difference]: Finished difference Result 2908 states and 3949 transitions. [2019-09-08 12:48:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:48:04,851 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-08 12:48:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:04,855 INFO L225 Difference]: With dead ends: 2908 [2019-09-08 12:48:04,855 INFO L226 Difference]: Without dead ends: 2722 [2019-09-08 12:48:04,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:48:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2019-09-08 12:48:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 823. [2019-09-08 12:48:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-08 12:48:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1019 transitions. [2019-09-08 12:48:05,408 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1019 transitions. Word has length 126 [2019-09-08 12:48:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:05,408 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1019 transitions. [2019-09-08 12:48:05,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:48:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1019 transitions. [2019-09-08 12:48:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:48:05,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:05,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,410 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1729624950, now seen corresponding path program 1 times [2019-09-08 12:48:05,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:05,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:06,291 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:48:06,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:06,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:48:06,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:48:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:48:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:48:06,293 INFO L87 Difference]: Start difference. First operand 823 states and 1019 transitions. Second operand 16 states. [2019-09-08 12:48:07,056 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:48:07,606 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:48:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:10,984 INFO L93 Difference]: Finished difference Result 2080 states and 2811 transitions. [2019-09-08 12:48:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:48:10,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 126 [2019-09-08 12:48:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:10,987 INFO L225 Difference]: With dead ends: 2080 [2019-09-08 12:48:10,987 INFO L226 Difference]: Without dead ends: 1894 [2019-09-08 12:48:10,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:48:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-09-08 12:48:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 807. [2019-09-08 12:48:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-08 12:48:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 997 transitions. [2019-09-08 12:48:11,580 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 997 transitions. Word has length 126 [2019-09-08 12:48:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:11,581 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 997 transitions. [2019-09-08 12:48:11,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:48:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 997 transitions. [2019-09-08 12:48:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:48:11,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:11,582 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:48:11,582 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1310444086, now seen corresponding path program 1 times [2019-09-08 12:48:11,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:12,950 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:48:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:48:12,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:48:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:48:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:12,951 INFO L87 Difference]: Start difference. First operand 807 states and 997 transitions. Second operand 21 states. [2019-09-08 12:48:14,027 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-08 12:48:14,287 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 12:48:14,459 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:48:14,629 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:48:14,819 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:48:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:18,987 INFO L93 Difference]: Finished difference Result 1651 states and 2181 transitions. [2019-09-08 12:48:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:48:18,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-08 12:48:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:18,990 INFO L225 Difference]: With dead ends: 1651 [2019-09-08 12:48:18,990 INFO L226 Difference]: Without dead ends: 1480 [2019-09-08 12:48:18,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:48:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-08 12:48:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 825. [2019-09-08 12:48:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-08 12:48:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1017 transitions. [2019-09-08 12:48:19,577 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1017 transitions. Word has length 126 [2019-09-08 12:48:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:19,578 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1017 transitions. [2019-09-08 12:48:19,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:48:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1017 transitions. [2019-09-08 12:48:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:19,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:19,579 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:48:19,579 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash -399736137, now seen corresponding path program 1 times [2019-09-08 12:48:19,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:19,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:20,145 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:48:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:20,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:48:20,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:48:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:48:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:48:20,146 INFO L87 Difference]: Start difference. First operand 825 states and 1017 transitions. Second operand 13 states. [2019-09-08 12:48:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:22,970 INFO L93 Difference]: Finished difference Result 1656 states and 2123 transitions. [2019-09-08 12:48:22,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:48:22,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-08 12:48:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:22,972 INFO L225 Difference]: With dead ends: 1656 [2019-09-08 12:48:22,972 INFO L226 Difference]: Without dead ends: 1482 [2019-09-08 12:48:22,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:48:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2019-09-08 12:48:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 821. [2019-09-08 12:48:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-08 12:48:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1012 transitions. [2019-09-08 12:48:23,528 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1012 transitions. Word has length 127 [2019-09-08 12:48:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:23,528 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1012 transitions. [2019-09-08 12:48:23,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:48:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1012 transitions. [2019-09-08 12:48:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:23,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:23,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,530 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 9866519, now seen corresponding path program 1 times [2019-09-08 12:48:23,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:23,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:24,347 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:48:24,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:24,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:48:24,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:48:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:48:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:48:24,348 INFO L87 Difference]: Start difference. First operand 821 states and 1012 transitions. Second operand 17 states. [2019-09-08 12:48:25,142 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:48:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:29,305 INFO L93 Difference]: Finished difference Result 1780 states and 2348 transitions. [2019-09-08 12:48:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:48:29,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-08 12:48:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:29,307 INFO L225 Difference]: With dead ends: 1780 [2019-09-08 12:48:29,307 INFO L226 Difference]: Without dead ends: 1603 [2019-09-08 12:48:29,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:48:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-09-08 12:48:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 821. [2019-09-08 12:48:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-08 12:48:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1011 transitions. [2019-09-08 12:48:29,876 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1011 transitions. Word has length 127 [2019-09-08 12:48:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:29,877 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1011 transitions. [2019-09-08 12:48:29,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:48:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1011 transitions. [2019-09-08 12:48:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:29,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:29,878 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:48:29,878 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -998433958, now seen corresponding path program 1 times [2019-09-08 12:48:29,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:29,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:29,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:31,185 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:48:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:48:31,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:48:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:48:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:48:31,187 INFO L87 Difference]: Start difference. First operand 821 states and 1011 transitions. Second operand 20 states. [2019-09-08 12:48:31,448 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:48:31,883 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-09-08 12:48:32,056 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-08 12:48:32,225 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-08 12:48:32,505 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:48:32,907 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:48:33,251 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 12:48:33,553 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 12:48:33,844 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 12:48:34,120 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-08 12:48:34,438 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:48:35,091 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:48:35,603 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:48:36,611 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-08 12:48:37,142 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-08 12:48:37,369 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:48:41,350 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-08 12:48:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:42,501 INFO L93 Difference]: Finished difference Result 2547 states and 3439 transitions. [2019-09-08 12:48:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:48:42,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 127 [2019-09-08 12:48:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:42,504 INFO L225 Difference]: With dead ends: 2547 [2019-09-08 12:48:42,504 INFO L226 Difference]: Without dead ends: 2376 [2019-09-08 12:48:42,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 12:48:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-09-08 12:48:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 820. [2019-09-08 12:48:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-08 12:48:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1009 transitions. [2019-09-08 12:48:43,119 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1009 transitions. Word has length 127 [2019-09-08 12:48:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:43,120 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1009 transitions. [2019-09-08 12:48:43,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:48:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1009 transitions. [2019-09-08 12:48:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:43,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:43,121 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:48:43,121 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:43,121 INFO L82 PathProgramCache]: Analyzing trace with hash 133788243, now seen corresponding path program 1 times [2019-09-08 12:48:43,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:43,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:44,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:44,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:48:44,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:48:44,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:48:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:48:44,052 INFO L87 Difference]: Start difference. First operand 820 states and 1009 transitions. Second operand 17 states. [2019-09-08 12:48:44,780 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:48:44,944 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:48:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:48,202 INFO L93 Difference]: Finished difference Result 1814 states and 2388 transitions. [2019-09-08 12:48:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:48:48,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-08 12:48:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:48,204 INFO L225 Difference]: With dead ends: 1814 [2019-09-08 12:48:48,204 INFO L226 Difference]: Without dead ends: 1594 [2019-09-08 12:48:48,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:48:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-09-08 12:48:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 785. [2019-09-08 12:48:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-08 12:48:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 968 transitions. [2019-09-08 12:48:48,790 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 968 transitions. Word has length 127 [2019-09-08 12:48:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:48,790 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 968 transitions. [2019-09-08 12:48:48,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:48:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 968 transitions. [2019-09-08 12:48:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:48,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:48,791 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:48:48,791 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash -960693953, now seen corresponding path program 1 times [2019-09-08 12:48:48,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:49,565 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:48:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:48:49,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:48:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:48:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:48:49,566 INFO L87 Difference]: Start difference. First operand 785 states and 968 transitions. Second operand 13 states. [2019-09-08 12:48:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:54,367 INFO L93 Difference]: Finished difference Result 2738 states and 3729 transitions. [2019-09-08 12:48:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:48:54,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-08 12:48:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:54,370 INFO L225 Difference]: With dead ends: 2738 [2019-09-08 12:48:54,370 INFO L226 Difference]: Without dead ends: 2534 [2019-09-08 12:48:54,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:48:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-09-08 12:48:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 751. [2019-09-08 12:48:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-08 12:48:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 927 transitions. [2019-09-08 12:48:54,969 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 927 transitions. Word has length 127 [2019-09-08 12:48:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:54,969 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 927 transitions. [2019-09-08 12:48:54,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:48:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 927 transitions. [2019-09-08 12:48:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:54,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:54,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,970 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:54,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash -666133872, now seen corresponding path program 1 times [2019-09-08 12:48:54,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:55,543 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:48:55,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:55,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:48:55,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:48:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:48:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:48:55,544 INFO L87 Difference]: Start difference. First operand 751 states and 927 transitions. Second operand 12 states. [2019-09-08 12:48:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:57,898 INFO L93 Difference]: Finished difference Result 1280 states and 1649 transitions. [2019-09-08 12:48:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:48:57,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2019-09-08 12:48:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:57,900 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 12:48:57,900 INFO L226 Difference]: Without dead ends: 1104 [2019-09-08 12:48:57,901 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:48:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-09-08 12:48:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 718. [2019-09-08 12:48:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-08 12:48:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 882 transitions. [2019-09-08 12:48:58,466 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 882 transitions. Word has length 127 [2019-09-08 12:48:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:58,466 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 882 transitions. [2019-09-08 12:48:58,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:48:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 882 transitions. [2019-09-08 12:48:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:48:58,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:58,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:58,467 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1422527876, now seen corresponding path program 1 times [2019-09-08 12:48:58,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:58,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:48:58,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:48:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:48:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:48:58,938 INFO L87 Difference]: Start difference. First operand 718 states and 882 transitions. Second operand 11 states. [2019-09-08 12:49:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:02,896 INFO L93 Difference]: Finished difference Result 2470 states and 3408 transitions. [2019-09-08 12:49:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:02,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-08 12:49:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:02,899 INFO L225 Difference]: With dead ends: 2470 [2019-09-08 12:49:02,899 INFO L226 Difference]: Without dead ends: 2253 [2019-09-08 12:49:02,899 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:49:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-09-08 12:49:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 662. [2019-09-08 12:49:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 12:49:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 813 transitions. [2019-09-08 12:49:03,495 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 813 transitions. Word has length 127 [2019-09-08 12:49:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:03,495 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 813 transitions. [2019-09-08 12:49:03,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:49:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 813 transitions. [2019-09-08 12:49:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:49:03,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:03,496 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:49:03,496 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -662317091, now seen corresponding path program 1 times [2019-09-08 12:49:03,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:03,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:04,017 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:49:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:49:04,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:49:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:49:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:49:04,018 INFO L87 Difference]: Start difference. First operand 662 states and 813 transitions. Second operand 12 states. [2019-09-08 12:49:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:07,397 INFO L93 Difference]: Finished difference Result 2115 states and 2838 transitions. [2019-09-08 12:49:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:49:07,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2019-09-08 12:49:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:07,399 INFO L225 Difference]: With dead ends: 2115 [2019-09-08 12:49:07,399 INFO L226 Difference]: Without dead ends: 1796 [2019-09-08 12:49:07,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:49:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2019-09-08 12:49:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 506. [2019-09-08 12:49:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-08 12:49:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 628 transitions. [2019-09-08 12:49:07,900 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 628 transitions. Word has length 127 [2019-09-08 12:49:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:07,901 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 628 transitions. [2019-09-08 12:49:07,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:49:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 628 transitions. [2019-09-08 12:49:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:49:07,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:07,901 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:49:07,901 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2033677576, now seen corresponding path program 1 times [2019-09-08 12:49:07,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:07,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:07,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:07,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:07,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:09,576 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:49:09,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:09,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:49:09,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:49:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:49:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:49:09,578 INFO L87 Difference]: Start difference. First operand 506 states and 628 transitions. Second operand 26 states. [2019-09-08 12:49:10,888 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 12:49:11,120 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-08 12:49:11,446 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 12:49:11,640 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:49:11,833 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:49:12,076 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:49:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:15,617 INFO L93 Difference]: Finished difference Result 1264 states and 1658 transitions. [2019-09-08 12:49:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:49:15,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2019-09-08 12:49:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:15,619 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 12:49:15,619 INFO L226 Difference]: Without dead ends: 1090 [2019-09-08 12:49:15,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=399, Invalid=1953, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:49:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-08 12:49:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 537. [2019-09-08 12:49:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-08 12:49:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 665 transitions. [2019-09-08 12:49:16,127 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 665 transitions. Word has length 127 [2019-09-08 12:49:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:16,127 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 665 transitions. [2019-09-08 12:49:16,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:49:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 665 transitions. [2019-09-08 12:49:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:49:16,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:16,128 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, 1] [2019-09-08 12:49:16,128 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:16,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1656199613, now seen corresponding path program 1 times [2019-09-08 12:49:16,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:16,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:16,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:16,714 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:49:16,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:16,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:49:16,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:49:16,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:49:16,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:49:16,715 INFO L87 Difference]: Start difference. First operand 537 states and 665 transitions. Second operand 14 states. [2019-09-08 12:49:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:19,121 INFO L93 Difference]: Finished difference Result 982 states and 1287 transitions. [2019-09-08 12:49:19,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:49:19,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 128 [2019-09-08 12:49:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:19,123 INFO L225 Difference]: With dead ends: 982 [2019-09-08 12:49:19,123 INFO L226 Difference]: Without dead ends: 801 [2019-09-08 12:49:19,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:49:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-08 12:49:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 526. [2019-09-08 12:49:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-08 12:49:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 653 transitions. [2019-09-08 12:49:19,638 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 653 transitions. Word has length 128 [2019-09-08 12:49:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:19,638 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 653 transitions. [2019-09-08 12:49:19,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:49:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 653 transitions. [2019-09-08 12:49:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:49:19,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:19,639 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, 1] [2019-09-08 12:49:19,639 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1860453958, now seen corresponding path program 1 times [2019-09-08 12:49:19,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:19,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:19,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:20,448 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:49:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:49:20,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:49:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:49:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:49:20,449 INFO L87 Difference]: Start difference. First operand 526 states and 653 transitions. Second operand 13 states. [2019-09-08 12:49:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:22,955 INFO L93 Difference]: Finished difference Result 1252 states and 1659 transitions. [2019-09-08 12:49:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:49:22,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-08 12:49:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:22,956 INFO L225 Difference]: With dead ends: 1252 [2019-09-08 12:49:22,956 INFO L226 Difference]: Without dead ends: 1064 [2019-09-08 12:49:22,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:49:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-09-08 12:49:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 508. [2019-09-08 12:49:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-08 12:49:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 633 transitions. [2019-09-08 12:49:23,476 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 633 transitions. Word has length 128 [2019-09-08 12:49:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:23,476 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 633 transitions. [2019-09-08 12:49:23,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:49:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 633 transitions. [2019-09-08 12:49:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:49:23,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:23,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,477 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1007623233, now seen corresponding path program 1 times [2019-09-08 12:49:23,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:23,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:24,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:49:24,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:24,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:49:24,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:49:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:49:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:49:24,003 INFO L87 Difference]: Start difference. First operand 508 states and 633 transitions. Second operand 12 states. [2019-09-08 12:49:24,523 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:49:24,661 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:49:24,923 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-08 12:49:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:27,474 INFO L93 Difference]: Finished difference Result 1670 states and 2258 transitions. [2019-09-08 12:49:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:49:27,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-08 12:49:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:27,481 INFO L225 Difference]: With dead ends: 1670 [2019-09-08 12:49:27,481 INFO L226 Difference]: Without dead ends: 1431 [2019-09-08 12:49:27,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-08 12:49:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 426. [2019-09-08 12:49:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:49:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 535 transitions. [2019-09-08 12:49:27,924 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 535 transitions. Word has length 128 [2019-09-08 12:49:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:27,924 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 535 transitions. [2019-09-08 12:49:27,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:49:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 535 transitions. [2019-09-08 12:49:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:49:27,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:27,925 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, 1] [2019-09-08 12:49:27,925 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -789644279, now seen corresponding path program 1 times [2019-09-08 12:49:27,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:27,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:27,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:27,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:28,167 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:49:28,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:28,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:28,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:28,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:28,168 INFO L87 Difference]: Start difference. First operand 426 states and 535 transitions. Second operand 9 states. [2019-09-08 12:49:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:30,073 INFO L93 Difference]: Finished difference Result 890 states and 1182 transitions. [2019-09-08 12:49:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:49:30,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 12:49:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:30,075 INFO L225 Difference]: With dead ends: 890 [2019-09-08 12:49:30,075 INFO L226 Difference]: Without dead ends: 686 [2019-09-08 12:49:30,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:49:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-08 12:49:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 426. [2019-09-08 12:49:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:49:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 533 transitions. [2019-09-08 12:49:30,517 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 533 transitions. Word has length 128 [2019-09-08 12:49:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:30,518 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 533 transitions. [2019-09-08 12:49:30,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 533 transitions. [2019-09-08 12:49:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:49:30,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:30,518 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, 1] [2019-09-08 12:49:30,519 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1300753321, now seen corresponding path program 1 times [2019-09-08 12:49:30,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:30,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:30,764 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:49:30,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:30,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:30,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:30,765 INFO L87 Difference]: Start difference. First operand 426 states and 533 transitions. Second operand 9 states. [2019-09-08 12:49:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:32,501 INFO L93 Difference]: Finished difference Result 660 states and 854 transitions. [2019-09-08 12:49:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:49:32,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 12:49:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:32,502 INFO L225 Difference]: With dead ends: 660 [2019-09-08 12:49:32,502 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 12:49:32,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:49:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 12:49:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 426. [2019-09-08 12:49:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:49:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 532 transitions. [2019-09-08 12:49:32,972 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 532 transitions. Word has length 128 [2019-09-08 12:49:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:32,972 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 532 transitions. [2019-09-08 12:49:32,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 532 transitions. [2019-09-08 12:49:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:49:32,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:32,973 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, 1, 1] [2019-09-08 12:49:32,973 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1284634217, now seen corresponding path program 1 times [2019-09-08 12:49:32,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:32,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:32,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:33,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:33,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:33,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:33,221 INFO L87 Difference]: Start difference. First operand 426 states and 532 transitions. Second operand 9 states. [2019-09-08 12:49:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:34,998 INFO L93 Difference]: Finished difference Result 660 states and 853 transitions. [2019-09-08 12:49:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:49:34,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-08 12:49:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:34,999 INFO L225 Difference]: With dead ends: 660 [2019-09-08 12:49:34,999 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 12:49:35,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:49:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 12:49:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 426. [2019-09-08 12:49:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:49:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 531 transitions. [2019-09-08 12:49:35,440 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 531 transitions. Word has length 129 [2019-09-08 12:49:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:35,440 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 531 transitions. [2019-09-08 12:49:35,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 531 transitions. [2019-09-08 12:49:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:49:35,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:35,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,441 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash 252766446, now seen corresponding path program 1 times [2019-09-08 12:49:35,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:35,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:35,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:37,683 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:49:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2019-09-08 12:49:37,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 12:49:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 12:49:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:49:37,684 INFO L87 Difference]: Start difference. First operand 426 states and 531 transitions. Second operand 37 states. [2019-09-08 12:49:38,271 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 149 [2019-09-08 12:49:39,711 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:49:40,420 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:49:40,692 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-08 12:49:41,037 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:49:41,419 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-08 12:49:41,873 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-09-08 12:49:42,416 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-09-08 12:49:42,698 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-08 12:49:42,973 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-08 12:49:43,179 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:49:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:49,428 INFO L93 Difference]: Finished difference Result 955 states and 1236 transitions. [2019-09-08 12:49:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 12:49:49,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 130 [2019-09-08 12:49:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:49,430 INFO L225 Difference]: With dead ends: 955 [2019-09-08 12:49:49,430 INFO L226 Difference]: Without dead ends: 949 [2019-09-08 12:49:49,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=711, Invalid=4259, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 12:49:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states.