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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:40:46,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:40:46,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:40:46,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:40:46,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:40:46,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:40:46,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:40:46,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:40:46,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:40:46,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:40:46,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:40:46,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:40:46,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:40:46,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:40:46,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:40:46,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:40:46,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:40:46,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:40:46,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:40:46,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:40:46,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:40:46,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:40:46,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:40:46,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:40:46,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:40:46,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:40:46,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:40:46,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:40:46,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:40:46,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:40:46,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:40:46,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:40:46,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:40:46,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:40:46,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:40:46,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:40:46,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:40:46,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:40:46,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:40:46,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:40:46,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:40:46,078 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:40:46,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:40:46,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:40:46,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:40:46,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:40:46,096 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:40:46,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:40:46,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:40:46,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:40:46,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:40:46,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:40:46,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:40:46,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:40:46,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:40:46,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:40:46,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:40:46,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:40:46,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:40:46,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:40:46,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:40:46,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:40:46,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:40:46,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:40:46,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:40:46,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:40:46,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:40:46,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:40:46,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:40:46,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:40:46,148 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:40:46,149 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:40:46,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46327372f/a6ba57d95608483a87b41e66e01af6ec/FLAGc3bb4cf52 [2019-09-08 12:40:47,094 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:40:47,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:40:47,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46327372f/a6ba57d95608483a87b41e66e01af6ec/FLAGc3bb4cf52 [2019-09-08 12:40:47,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46327372f/a6ba57d95608483a87b41e66e01af6ec [2019-09-08 12:40:47,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:40:47,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:40:47,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:40:47,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:40:47,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:40:47,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:40:47" (1/1) ... [2019-09-08 12:40:47,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b55efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:47, skipping insertion in model container [2019-09-08 12:40:47,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:40:47" (1/1) ... [2019-09-08 12:40:47,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:40:48,030 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:40:50,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:40:50,992 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:40:52,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:40:52,981 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:40:52,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52 WrapperNode [2019-09-08 12:40:52,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:40:52,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:40:52,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:40:52,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:40:52,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:52,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (1/1) ... [2019-09-08 12:40:53,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:40:53,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:40:53,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:40:53,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:40:53,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (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:40:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:40:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:40:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:40:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:40:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:40:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:40:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:40:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:40:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:40:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:40:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:40:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:40:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:40:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:40:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:40:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:40:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:40:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:41:05,167 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:41:05,167 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:41:05,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:05 BoogieIcfgContainer [2019-09-08 12:41:05,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:41:05,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:41:05,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:41:05,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:41:05,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:40:47" (1/3) ... [2019-09-08 12:41:05,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d90c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:05, skipping insertion in model container [2019-09-08 12:41:05,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:40:52" (2/3) ... [2019-09-08 12:41:05,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d90c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:05, skipping insertion in model container [2019-09-08 12:41:05,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:05" (3/3) ... [2019-09-08 12:41:05,190 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:41:05,200 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:41:05,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-08 12:41:05,237 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-08 12:41:05,301 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:41:05,301 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:41:05,302 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:41:05,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:41:05,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:41:05,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:41:05,302 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:41:05,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:41:05,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:41:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states. [2019-09-08 12:41:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:41:05,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:05,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,447 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2084696671, now seen corresponding path program 1 times [2019-09-08 12:41:05,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:05,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:05,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:05,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:06,298 INFO L134 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,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:06,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:06,326 INFO L87 Difference]: Start difference. First operand 5028 states. Second operand 5 states. [2019-09-08 12:41:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:12,325 INFO L93 Difference]: Finished difference Result 6843 states and 12162 transitions. [2019-09-08 12:41:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:12,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:41:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:12,389 INFO L225 Difference]: With dead ends: 6843 [2019-09-08 12:41:12,390 INFO L226 Difference]: Without dead ends: 4512 [2019-09-08 12:41:12,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:41:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-09-08 12:41:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4512. [2019-09-08 12:41:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4512 states. [2019-09-08 12:41:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 5953 transitions. [2019-09-08 12:41:12,687 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 5953 transitions. Word has length 105 [2019-09-08 12:41:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:12,689 INFO L475 AbstractCegarLoop]: Abstraction has 4512 states and 5953 transitions. [2019-09-08 12:41:12,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 5953 transitions. [2019-09-08 12:41:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:41:12,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:12,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,705 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1648814295, now seen corresponding path program 1 times [2019-09-08 12:41:12,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:12,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:13,047 INFO L134 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:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:13,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:13,054 INFO L87 Difference]: Start difference. First operand 4512 states and 5953 transitions. Second operand 5 states. [2019-09-08 12:41:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:16,844 INFO L93 Difference]: Finished difference Result 5803 states and 7664 transitions. [2019-09-08 12:41:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:16,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:41:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:16,869 INFO L225 Difference]: With dead ends: 5803 [2019-09-08 12:41:16,869 INFO L226 Difference]: Without dead ends: 3558 [2019-09-08 12:41:16,875 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:41:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-09-08 12:41:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2019-09-08 12:41:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-09-08 12:41:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4774 transitions. [2019-09-08 12:41:16,984 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4774 transitions. Word has length 105 [2019-09-08 12:41:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:16,985 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 4774 transitions. [2019-09-08 12:41:16,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4774 transitions. [2019-09-08 12:41:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:41:16,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:16,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,996 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -337661044, now seen corresponding path program 1 times [2019-09-08 12:41:16,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:16,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:17,230 INFO L134 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:17,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:17,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:17,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:17,232 INFO L87 Difference]: Start difference. First operand 3558 states and 4774 transitions. Second operand 5 states. [2019-09-08 12:41:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:22,345 INFO L93 Difference]: Finished difference Result 6555 states and 8857 transitions. [2019-09-08 12:41:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:22,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:41:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:22,367 INFO L225 Difference]: With dead ends: 6555 [2019-09-08 12:41:22,368 INFO L226 Difference]: Without dead ends: 4753 [2019-09-08 12:41:22,373 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:41:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-09-08 12:41:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 4525. [2019-09-08 12:41:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4525 states. [2019-09-08 12:41:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 6246 transitions. [2019-09-08 12:41:22,543 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 6246 transitions. Word has length 105 [2019-09-08 12:41:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:22,544 INFO L475 AbstractCegarLoop]: Abstraction has 4525 states and 6246 transitions. [2019-09-08 12:41:22,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 6246 transitions. [2019-09-08 12:41:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:41:22,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:22,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,556 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1249207372, now seen corresponding path program 1 times [2019-09-08 12:41:22,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:22,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:22,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:41:22,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:22,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:22,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:22,735 INFO L87 Difference]: Start difference. First operand 4525 states and 6246 transitions. Second operand 5 states. [2019-09-08 12:41:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:25,250 INFO L93 Difference]: Finished difference Result 5634 states and 7724 transitions. [2019-09-08 12:41:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:25,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:41:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:25,265 INFO L225 Difference]: With dead ends: 5634 [2019-09-08 12:41:25,265 INFO L226 Difference]: Without dead ends: 3413 [2019-09-08 12:41:25,270 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:41:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-09-08 12:41:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3413. [2019-09-08 12:41:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-09-08 12:41:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4746 transitions. [2019-09-08 12:41:25,387 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4746 transitions. Word has length 106 [2019-09-08 12:41:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:25,387 INFO L475 AbstractCegarLoop]: Abstraction has 3413 states and 4746 transitions. [2019-09-08 12:41:25,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4746 transitions. [2019-09-08 12:41:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:41:25,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:25,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,397 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1713396583, now seen corresponding path program 1 times [2019-09-08 12:41:25,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:25,568 INFO L134 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,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:25,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:25,570 INFO L87 Difference]: Start difference. First operand 3413 states and 4746 transitions. Second operand 5 states. [2019-09-08 12:41:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:27,363 INFO L93 Difference]: Finished difference Result 4165 states and 5724 transitions. [2019-09-08 12:41:27,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:27,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 12:41:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:27,375 INFO L225 Difference]: With dead ends: 4165 [2019-09-08 12:41:27,376 INFO L226 Difference]: Without dead ends: 2489 [2019-09-08 12:41:27,381 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:41:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2019-09-08 12:41:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2019-09-08 12:41:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-09-08 12:41:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3483 transitions. [2019-09-08 12:41:27,495 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3483 transitions. Word has length 107 [2019-09-08 12:41:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:27,496 INFO L475 AbstractCegarLoop]: Abstraction has 2489 states and 3483 transitions. [2019-09-08 12:41:27,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3483 transitions. [2019-09-08 12:41:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:41:27,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:27,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,506 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1868157402, now seen corresponding path program 1 times [2019-09-08 12:41:27,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:27,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:27,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:27,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:27,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:27,749 INFO L134 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:27,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:27,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:27,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:27,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:27,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:27,751 INFO L87 Difference]: Start difference. First operand 2489 states and 3483 transitions. Second operand 5 states. [2019-09-08 12:41:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:29,317 INFO L93 Difference]: Finished difference Result 3591 states and 5022 transitions. [2019-09-08 12:41:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:29,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-08 12:41:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:29,326 INFO L225 Difference]: With dead ends: 3591 [2019-09-08 12:41:29,327 INFO L226 Difference]: Without dead ends: 2290 [2019-09-08 12:41:29,331 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:41:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-09-08 12:41:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2019-09-08 12:41:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-09-08 12:41:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3220 transitions. [2019-09-08 12:41:29,424 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3220 transitions. Word has length 108 [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 2290 states and 3220 transitions. [2019-09-08 12:41:29,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3220 transitions. [2019-09-08 12:41:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:41:29,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:29,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,432 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 270019854, now seen corresponding path program 1 times [2019-09-08 12:41:29,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:29,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:29,631 INFO L134 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,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:29,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:29,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:29,633 INFO L87 Difference]: Start difference. First operand 2290 states and 3220 transitions. Second operand 5 states. [2019-09-08 12:41:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:30,651 INFO L93 Difference]: Finished difference Result 2677 states and 3688 transitions. [2019-09-08 12:41:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:30,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 12:41:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:30,658 INFO L225 Difference]: With dead ends: 2677 [2019-09-08 12:41:30,660 INFO L226 Difference]: Without dead ends: 1560 [2019-09-08 12:41:30,663 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:41:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2019-09-08 12:41:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2019-09-08 12:41:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2205 transitions. [2019-09-08 12:41:30,727 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2205 transitions. Word has length 109 [2019-09-08 12:41:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:30,727 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2205 transitions. [2019-09-08 12:41:30,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2205 transitions. [2019-09-08 12:41:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:41:30,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:30,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,733 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -898674966, now seen corresponding path program 1 times [2019-09-08 12:41:30,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:30,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:30,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:30,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:31,132 INFO L134 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:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:41:31,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:41:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:41:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:41:31,135 INFO L87 Difference]: Start difference. First operand 1560 states and 2205 transitions. Second operand 8 states. [2019-09-08 12:41:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:33,451 INFO L93 Difference]: Finished difference Result 2683 states and 3669 transitions. [2019-09-08 12:41:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:41:33,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-08 12:41:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:33,460 INFO L225 Difference]: With dead ends: 2683 [2019-09-08 12:41:33,460 INFO L226 Difference]: Without dead ends: 2019 [2019-09-08 12:41:33,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:41:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-09-08 12:41:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1560. [2019-09-08 12:41:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2204 transitions. [2019-09-08 12:41:33,556 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2204 transitions. Word has length 110 [2019-09-08 12:41:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:33,557 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2204 transitions. [2019-09-08 12:41:33,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:41:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2204 transitions. [2019-09-08 12:41:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:41:33,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:33,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:33,570 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash 494054766, now seen corresponding path program 1 times [2019-09-08 12:41:33,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:33,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:33,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:33,946 INFO L134 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:33,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:33,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:33,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:33,948 INFO L87 Difference]: Start difference. First operand 1560 states and 2204 transitions. Second operand 9 states. [2019-09-08 12:41:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:36,933 INFO L93 Difference]: Finished difference Result 3035 states and 4342 transitions. [2019-09-08 12:41:36,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:36,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 12:41:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:36,950 INFO L225 Difference]: With dead ends: 3035 [2019-09-08 12:41:36,951 INFO L226 Difference]: Without dead ends: 2771 [2019-09-08 12:41:36,953 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:41:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-09-08 12:41:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1560. [2019-09-08 12:41:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2203 transitions. [2019-09-08 12:41:37,123 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2203 transitions. Word has length 110 [2019-09-08 12:41:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:37,123 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2203 transitions. [2019-09-08 12:41:37,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2203 transitions. [2019-09-08 12:41:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:41:37,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:37,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,128 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -847808881, now seen corresponding path program 1 times [2019-09-08 12:41:37,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:37,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:37,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:37,389 INFO L134 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:37,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:37,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:37,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:37,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:37,391 INFO L87 Difference]: Start difference. First operand 1560 states and 2203 transitions. Second operand 9 states. [2019-09-08 12:41:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:40,528 INFO L93 Difference]: Finished difference Result 2371 states and 3399 transitions. [2019-09-08 12:41:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:41:40,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 12:41:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:40,535 INFO L225 Difference]: With dead ends: 2371 [2019-09-08 12:41:40,536 INFO L226 Difference]: Without dead ends: 1987 [2019-09-08 12:41:40,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:41:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-09-08 12:41:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1560. [2019-09-08 12:41:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2202 transitions. [2019-09-08 12:41:40,631 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2202 transitions. Word has length 110 [2019-09-08 12:41:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:40,631 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2202 transitions. [2019-09-08 12:41:40,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2202 transitions. [2019-09-08 12:41:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:40,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:40,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,635 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1844748091, now seen corresponding path program 1 times [2019-09-08 12:41:40,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:40,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:40,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:40,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:40,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:40,902 INFO L134 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:40,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:40,904 INFO L87 Difference]: Start difference. First operand 1560 states and 2202 transitions. Second operand 9 states. [2019-09-08 12:41:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:44,094 INFO L93 Difference]: Finished difference Result 3004 states and 4285 transitions. [2019-09-08 12:41:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:44,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:41:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:44,103 INFO L225 Difference]: With dead ends: 3004 [2019-09-08 12:41:44,103 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:41:44,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:41:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:41:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2200 transitions. [2019-09-08 12:41:44,192 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2200 transitions. Word has length 112 [2019-09-08 12:41:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:44,193 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2200 transitions. [2019-09-08 12:41:44,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2200 transitions. [2019-09-08 12:41:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:44,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:44,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,197 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1416254925, now seen corresponding path program 1 times [2019-09-08 12:41:44,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:44,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:44,475 INFO L134 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,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:44,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:44,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:44,477 INFO L87 Difference]: Start difference. First operand 1560 states and 2200 transitions. Second operand 9 states. [2019-09-08 12:41:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:48,260 INFO L93 Difference]: Finished difference Result 3139 states and 4480 transitions. [2019-09-08 12:41:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:48,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:41:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:48,267 INFO L225 Difference]: With dead ends: 3139 [2019-09-08 12:41:48,267 INFO L226 Difference]: Without dead ends: 2771 [2019-09-08 12:41:48,269 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:41:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-09-08 12:41:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1560. [2019-09-08 12:41:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2198 transitions. [2019-09-08 12:41:48,385 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2198 transitions. Word has length 112 [2019-09-08 12:41:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:48,385 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2198 transitions. [2019-09-08 12:41:48,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2198 transitions. [2019-09-08 12:41:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:48,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:48,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash 248156924, now seen corresponding path program 1 times [2019-09-08 12:41:48,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:48,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:48,639 INFO L134 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:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:48,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:48,641 INFO L87 Difference]: Start difference. First operand 1560 states and 2198 transitions. Second operand 9 states. [2019-09-08 12:41:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:51,289 INFO L93 Difference]: Finished difference Result 2637 states and 3759 transitions. [2019-09-08 12:41:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:41:51,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:41:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:51,294 INFO L225 Difference]: With dead ends: 2637 [2019-09-08 12:41:51,294 INFO L226 Difference]: Without dead ends: 1987 [2019-09-08 12:41:51,296 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:41:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-09-08 12:41:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1560. [2019-09-08 12:41:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2196 transitions. [2019-09-08 12:41:51,407 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2196 transitions. Word has length 112 [2019-09-08 12:41:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:51,407 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2196 transitions. [2019-09-08 12:41:51,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2196 transitions. [2019-09-08 12:41:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:51,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:51,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] [2019-09-08 12:41:51,411 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1976342058, now seen corresponding path program 1 times [2019-09-08 12:41:51,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:51,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:51,672 INFO L134 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:51,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:51,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:51,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:51,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:51,674 INFO L87 Difference]: Start difference. First operand 1560 states and 2196 transitions. Second operand 9 states. [2019-09-08 12:41:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:55,310 INFO L93 Difference]: Finished difference Result 2959 states and 4214 transitions. [2019-09-08 12:41:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:55,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:41:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:55,318 INFO L225 Difference]: With dead ends: 2959 [2019-09-08 12:41:55,318 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:41:55,320 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:41:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:41:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:41:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:41:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2195 transitions. [2019-09-08 12:41:55,438 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2195 transitions. Word has length 112 [2019-09-08 12:41:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:55,439 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2195 transitions. [2019-09-08 12:41:55,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2195 transitions. [2019-09-08 12:41:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:41:55,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:55,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,443 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1279287633, now seen corresponding path program 1 times [2019-09-08 12:41:55,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:55,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:55,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:55,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:55,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:55,727 INFO L87 Difference]: Start difference. First operand 1560 states and 2195 transitions. Second operand 9 states. [2019-09-08 12:41:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:59,934 INFO L93 Difference]: Finished difference Result 3055 states and 4352 transitions. [2019-09-08 12:41:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:59,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:41:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,940 INFO L225 Difference]: With dead ends: 3055 [2019-09-08 12:41:59,940 INFO L226 Difference]: Without dead ends: 2771 [2019-09-08 12:41:59,941 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:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-09-08 12:42:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1560. [2019-09-08 12:42:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2194 transitions. [2019-09-08 12:42:00,047 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2194 transitions. Word has length 112 [2019-09-08 12:42:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:00,048 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2194 transitions. [2019-09-08 12:42:00,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2194 transitions. [2019-09-08 12:42:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:42:00,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:00,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,051 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1968325943, now seen corresponding path program 1 times [2019-09-08 12:42:00,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:00,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:00,285 INFO L134 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:00,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:00,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:00,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:00,287 INFO L87 Difference]: Start difference. First operand 1560 states and 2194 transitions. Second operand 9 states. [2019-09-08 12:42:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:03,856 INFO L93 Difference]: Finished difference Result 2960 states and 4212 transitions. [2019-09-08 12:42:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:03,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:42:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:03,861 INFO L225 Difference]: With dead ends: 2960 [2019-09-08 12:42:03,861 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:42:03,863 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:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:42:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:42:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2193 transitions. [2019-09-08 12:42:04,003 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2193 transitions. Word has length 112 [2019-09-08 12:42:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:04,003 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2193 transitions. [2019-09-08 12:42:04,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2193 transitions. [2019-09-08 12:42:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:42:04,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:04,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] [2019-09-08 12:42:04,007 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1110796236, now seen corresponding path program 1 times [2019-09-08 12:42:04,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:04,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:04,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:04,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:04,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:04,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:04,267 INFO L87 Difference]: Start difference. First operand 1560 states and 2193 transitions. Second operand 9 states. [2019-09-08 12:42:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:07,771 INFO L93 Difference]: Finished difference Result 2953 states and 4204 transitions. [2019-09-08 12:42:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:07,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:42:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:07,775 INFO L225 Difference]: With dead ends: 2953 [2019-09-08 12:42:07,775 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:42:07,776 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:42:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:42:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:42:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2192 transitions. [2019-09-08 12:42:07,902 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2192 transitions. Word has length 112 [2019-09-08 12:42:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:07,903 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2192 transitions. [2019-09-08 12:42:07,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2192 transitions. [2019-09-08 12:42:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:07,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:07,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,906 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 355254913, now seen corresponding path program 1 times [2019-09-08 12:42:07,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:08,189 INFO L134 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,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:08,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:08,191 INFO L87 Difference]: Start difference. First operand 1560 states and 2192 transitions. Second operand 9 states. [2019-09-08 12:42:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:11,501 INFO L93 Difference]: Finished difference Result 2934 states and 4165 transitions. [2019-09-08 12:42:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:11,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:11,505 INFO L225 Difference]: With dead ends: 2934 [2019-09-08 12:42:11,506 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:11,507 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:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2190 transitions. [2019-09-08 12:42:11,592 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2190 transitions. Word has length 114 [2019-09-08 12:42:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:11,592 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2190 transitions. [2019-09-08 12:42:11,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2190 transitions. [2019-09-08 12:42:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:11,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:11,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,595 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1169364953, now seen corresponding path program 1 times [2019-09-08 12:42:11,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:11,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:11,889 INFO L134 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:11,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:11,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:11,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:11,891 INFO L87 Difference]: Start difference. First operand 1560 states and 2190 transitions. Second operand 9 states. [2019-09-08 12:42:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:15,673 INFO L93 Difference]: Finished difference Result 3024 states and 4295 transitions. [2019-09-08 12:42:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:15,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:15,681 INFO L225 Difference]: With dead ends: 3024 [2019-09-08 12:42:15,681 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:42:15,684 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:42:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:42:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:42:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2188 transitions. [2019-09-08 12:42:15,774 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2188 transitions. Word has length 114 [2019-09-08 12:42:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:15,775 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2188 transitions. [2019-09-08 12:42:15,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2188 transitions. [2019-09-08 12:42:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:15,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:15,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,777 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash 977557393, now seen corresponding path program 1 times [2019-09-08 12:42:15,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:16,040 INFO L134 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:16,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:16,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:16,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:16,041 INFO L87 Difference]: Start difference. First operand 1560 states and 2188 transitions. Second operand 9 states. [2019-09-08 12:42:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:20,090 INFO L93 Difference]: Finished difference Result 3191 states and 4524 transitions. [2019-09-08 12:42:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:20,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:20,093 INFO L225 Difference]: With dead ends: 3191 [2019-09-08 12:42:20,094 INFO L226 Difference]: Without dead ends: 2771 [2019-09-08 12:42:20,097 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:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-09-08 12:42:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1560. [2019-09-08 12:42:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2186 transitions. [2019-09-08 12:42:20,186 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2186 transitions. Word has length 114 [2019-09-08 12:42:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:20,186 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2186 transitions. [2019-09-08 12:42:20,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2186 transitions. [2019-09-08 12:42:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:20,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:20,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,189 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1982880776, now seen corresponding path program 1 times [2019-09-08 12:42:20,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:20,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:20,405 INFO L134 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:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:20,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:20,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:20,407 INFO L87 Difference]: Start difference. First operand 1560 states and 2186 transitions. Second operand 9 states. [2019-09-08 12:42:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:24,180 INFO L93 Difference]: Finished difference Result 2930 states and 4153 transitions. [2019-09-08 12:42:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:24,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:24,184 INFO L225 Difference]: With dead ends: 2930 [2019-09-08 12:42:24,184 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:24,186 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:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2184 transitions. [2019-09-08 12:42:24,282 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2184 transitions. Word has length 114 [2019-09-08 12:42:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:24,282 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2184 transitions. [2019-09-08 12:42:24,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2184 transitions. [2019-09-08 12:42:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:24,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:24,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,285 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -97988579, now seen corresponding path program 1 times [2019-09-08 12:42:24,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:24,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:24,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:24,526 INFO L134 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:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:24,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:24,528 INFO L87 Difference]: Start difference. First operand 1560 states and 2184 transitions. Second operand 9 states. [2019-09-08 12:42:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:28,296 INFO L93 Difference]: Finished difference Result 3008 states and 4262 transitions. [2019-09-08 12:42:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:28,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:28,301 INFO L225 Difference]: With dead ends: 3008 [2019-09-08 12:42:28,301 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:42:28,302 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:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:42:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:42:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2182 transitions. [2019-09-08 12:42:28,398 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2182 transitions. Word has length 114 [2019-09-08 12:42:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:28,398 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2182 transitions. [2019-09-08 12:42:28,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2182 transitions. [2019-09-08 12:42:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:28,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:28,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,401 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1042040010, now seen corresponding path program 1 times [2019-09-08 12:42:28,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:28,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:28,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:28,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:28,662 INFO L134 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:28,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:28,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:28,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:28,663 INFO L87 Difference]: Start difference. First operand 1560 states and 2182 transitions. Second operand 9 states. [2019-09-08 12:42:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:32,811 INFO L93 Difference]: Finished difference Result 2930 states and 4149 transitions. [2019-09-08 12:42:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:32,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:32,814 INFO L225 Difference]: With dead ends: 2930 [2019-09-08 12:42:32,814 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:32,815 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:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2180 transitions. [2019-09-08 12:42:32,913 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2180 transitions. Word has length 114 [2019-09-08 12:42:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:32,914 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2180 transitions. [2019-09-08 12:42:32,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2180 transitions. [2019-09-08 12:42:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:32,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:32,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,916 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1558254658, now seen corresponding path program 1 times [2019-09-08 12:42:32,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:32,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:33,136 INFO L134 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:33,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:33,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:33,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:33,139 INFO L87 Difference]: Start difference. First operand 1560 states and 2180 transitions. Second operand 9 states. [2019-09-08 12:42:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:37,224 INFO L93 Difference]: Finished difference Result 2926 states and 4142 transitions. [2019-09-08 12:42:37,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:37,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:37,227 INFO L225 Difference]: With dead ends: 2926 [2019-09-08 12:42:37,228 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:37,229 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:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2178 transitions. [2019-09-08 12:42:37,354 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2178 transitions. Word has length 114 [2019-09-08 12:42:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:37,355 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2178 transitions. [2019-09-08 12:42:37,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2178 transitions. [2019-09-08 12:42:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:37,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:37,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,358 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1346432170, now seen corresponding path program 1 times [2019-09-08 12:42:37,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:37,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:37,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:42:37,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:37,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:37,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:37,584 INFO L87 Difference]: Start difference. First operand 1560 states and 2178 transitions. Second operand 9 states. [2019-09-08 12:42:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:41,601 INFO L93 Difference]: Finished difference Result 2911 states and 4116 transitions. [2019-09-08 12:42:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:41,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:41,604 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 12:42:41,605 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:41,606 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:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2177 transitions. [2019-09-08 12:42:41,707 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2177 transitions. Word has length 114 [2019-09-08 12:42:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:41,707 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2177 transitions. [2019-09-08 12:42:41,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2177 transitions. [2019-09-08 12:42:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:41,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:41,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,709 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash -642530797, now seen corresponding path program 1 times [2019-09-08 12:42:41,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:41,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:41,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:41,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:41,903 INFO L134 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:41,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:41,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:41,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:41,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:41,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:41,905 INFO L87 Difference]: Start difference. First operand 1560 states and 2177 transitions. Second operand 9 states. [2019-09-08 12:42:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:46,232 INFO L93 Difference]: Finished difference Result 2974 states and 4203 transitions. [2019-09-08 12:42:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:46,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:46,235 INFO L225 Difference]: With dead ends: 2974 [2019-09-08 12:42:46,235 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:42:46,236 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:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:42:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:42:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2176 transitions. [2019-09-08 12:42:46,368 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2176 transitions. Word has length 114 [2019-09-08 12:42:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:46,369 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2176 transitions. [2019-09-08 12:42:46,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2176 transitions. [2019-09-08 12:42:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:46,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:46,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,371 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1490931089, now seen corresponding path program 1 times [2019-09-08 12:42:46,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:46,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:46,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:42:46,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:46,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:46,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:46,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:46,585 INFO L87 Difference]: Start difference. First operand 1560 states and 2176 transitions. Second operand 9 states. [2019-09-08 12:42:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:50,870 INFO L93 Difference]: Finished difference Result 2911 states and 4114 transitions. [2019-09-08 12:42:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:50,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:50,874 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 12:42:50,874 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:50,875 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:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2175 transitions. [2019-09-08 12:42:50,984 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2175 transitions. Word has length 114 [2019-09-08 12:42:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:50,984 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2175 transitions. [2019-09-08 12:42:50,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2175 transitions. [2019-09-08 12:42:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:50,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:50,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,986 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1488430024, now seen corresponding path program 1 times [2019-09-08 12:42:50,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:50,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:51,179 INFO L134 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:51,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:51,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:51,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:51,181 INFO L87 Difference]: Start difference. First operand 1560 states and 2175 transitions. Second operand 9 states. [2019-09-08 12:42:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:55,384 INFO L93 Difference]: Finished difference Result 2905 states and 4106 transitions. [2019-09-08 12:42:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:55,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:55,387 INFO L225 Difference]: With dead ends: 2905 [2019-09-08 12:42:55,387 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:55,388 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:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2174 transitions. [2019-09-08 12:42:55,502 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2174 transitions. Word has length 114 [2019-09-08 12:42:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:55,502 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2174 transitions. [2019-09-08 12:42:55,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2174 transitions. [2019-09-08 12:42:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:55,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:55,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,504 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1197874350, now seen corresponding path program 1 times [2019-09-08 12:42:55,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:55,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:55,696 INFO L134 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:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:55,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:55,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:55,697 INFO L87 Difference]: Start difference. First operand 1560 states and 2174 transitions. Second operand 9 states. [2019-09-08 12:42:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:59,720 INFO L93 Difference]: Finished difference Result 2911 states and 4110 transitions. [2019-09-08 12:42:59,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:59,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:59,724 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 12:42:59,724 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:42:59,725 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:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:42:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:42:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:42:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2173 transitions. [2019-09-08 12:42:59,840 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2173 transitions. Word has length 114 [2019-09-08 12:42:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:59,840 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2173 transitions. [2019-09-08 12:42:59,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2173 transitions. [2019-09-08 12:42:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:59,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:59,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,842 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1977276383, now seen corresponding path program 1 times [2019-09-08 12:42:59,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:59,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:59,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:59,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:00,072 INFO L134 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:00,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:00,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:00,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:00,075 INFO L87 Difference]: Start difference. First operand 1560 states and 2173 transitions. Second operand 9 states. [2019-09-08 12:43:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:04,564 INFO L93 Difference]: Finished difference Result 2906 states and 4104 transitions. [2019-09-08 12:43:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:04,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:43:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:04,568 INFO L225 Difference]: With dead ends: 2906 [2019-09-08 12:43:04,568 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:04,569 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,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2172 transitions. [2019-09-08 12:43:04,717 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2172 transitions. Word has length 114 [2019-09-08 12:43:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:04,718 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2172 transitions. [2019-09-08 12:43:04,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2172 transitions. [2019-09-08 12:43:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:43:04,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:04,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,720 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1250027377, now seen corresponding path program 1 times [2019-09-08 12:43:04,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:04,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:04,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:04,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:04,918 INFO L87 Difference]: Start difference. First operand 1560 states and 2172 transitions. Second operand 9 states. [2019-09-08 12:43:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:09,077 INFO L93 Difference]: Finished difference Result 2906 states and 4103 transitions. [2019-09-08 12:43:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:09,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:43:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:09,081 INFO L225 Difference]: With dead ends: 2906 [2019-09-08 12:43:09,081 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:09,082 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,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2171 transitions. [2019-09-08 12:43:09,202 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2171 transitions. Word has length 114 [2019-09-08 12:43:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:09,202 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2171 transitions. [2019-09-08 12:43:09,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2171 transitions. [2019-09-08 12:43:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:43:09,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:09,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,205 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1570960927, now seen corresponding path program 1 times [2019-09-08 12:43:09,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:09,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:09,407 INFO L134 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:09,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:09,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:09,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:09,408 INFO L87 Difference]: Start difference. First operand 1560 states and 2171 transitions. Second operand 9 states. [2019-09-08 12:43:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:13,582 INFO L93 Difference]: Finished difference Result 2904 states and 4099 transitions. [2019-09-08 12:43:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:13,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:43:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:13,586 INFO L225 Difference]: With dead ends: 2904 [2019-09-08 12:43:13,586 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:13,587 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:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2170 transitions. [2019-09-08 12:43:13,708 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2170 transitions. Word has length 115 [2019-09-08 12:43:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:13,709 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2170 transitions. [2019-09-08 12:43:13,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2170 transitions. [2019-09-08 12:43:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:13,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:13,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,711 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash 752987660, now seen corresponding path program 1 times [2019-09-08 12:43:13,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:13,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:13,896 INFO L134 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:13,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:13,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:13,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:13,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:13,898 INFO L87 Difference]: Start difference. First operand 1560 states and 2170 transitions. Second operand 9 states. [2019-09-08 12:43:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:17,803 INFO L93 Difference]: Finished difference Result 2860 states and 4021 transitions. [2019-09-08 12:43:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:17,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:17,805 INFO L225 Difference]: With dead ends: 2860 [2019-09-08 12:43:17,806 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:17,807 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:43:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2168 transitions. [2019-09-08 12:43:17,931 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2168 transitions. Word has length 116 [2019-09-08 12:43:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:17,932 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2168 transitions. [2019-09-08 12:43:17,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2168 transitions. [2019-09-08 12:43:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:17,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:17,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,934 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash -757718014, now seen corresponding path program 1 times [2019-09-08 12:43:17,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:17,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:17,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:18,171 INFO L134 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:18,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:18,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:18,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:18,173 INFO L87 Difference]: Start difference. First operand 1560 states and 2168 transitions. Second operand 9 states. [2019-09-08 12:43:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:21,885 INFO L93 Difference]: Finished difference Result 2942 states and 4144 transitions. [2019-09-08 12:43:21,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:21,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:21,889 INFO L225 Difference]: With dead ends: 2942 [2019-09-08 12:43:21,889 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:21,890 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:43:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2166 transitions. [2019-09-08 12:43:22,018 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2166 transitions. Word has length 116 [2019-09-08 12:43:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:22,018 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2166 transitions. [2019-09-08 12:43:22,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2166 transitions. [2019-09-08 12:43:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:22,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:22,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] [2019-09-08 12:43:22,020 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -125894625, now seen corresponding path program 1 times [2019-09-08 12:43:22,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:22,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:22,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:22,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:22,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:22,208 INFO L87 Difference]: Start difference. First operand 1560 states and 2166 transitions. Second operand 9 states. [2019-09-08 12:43:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:26,368 INFO L93 Difference]: Finished difference Result 3040 states and 4273 transitions. [2019-09-08 12:43:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:26,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:26,371 INFO L225 Difference]: With dead ends: 3040 [2019-09-08 12:43:26,371 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 12:43:26,373 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:43:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 12:43:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1560. [2019-09-08 12:43:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2164 transitions. [2019-09-08 12:43:26,508 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2164 transitions. Word has length 116 [2019-09-08 12:43:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:26,509 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2164 transitions. [2019-09-08 12:43:26,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2164 transitions. [2019-09-08 12:43:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:26,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:26,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,512 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash 626445332, now seen corresponding path program 1 times [2019-09-08 12:43:26,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:26,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:26,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:26,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:43:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:26,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:26,716 INFO L87 Difference]: Start difference. First operand 1560 states and 2164 transitions. Second operand 9 states. [2019-09-08 12:43:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:30,885 INFO L93 Difference]: Finished difference Result 2860 states and 4015 transitions. [2019-09-08 12:43:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:30,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:30,889 INFO L225 Difference]: With dead ends: 2860 [2019-09-08 12:43:30,889 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:30,890 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:43:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2162 transitions. [2019-09-08 12:43:31,024 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2162 transitions. Word has length 116 [2019-09-08 12:43:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:31,024 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2162 transitions. [2019-09-08 12:43:31,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2162 transitions. [2019-09-08 12:43:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:31,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:31,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,027 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -884260342, now seen corresponding path program 1 times [2019-09-08 12:43:31,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:31,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:31,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:43:31,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:31,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:31,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:31,267 INFO L87 Difference]: Start difference. First operand 1560 states and 2162 transitions. Second operand 9 states. [2019-09-08 12:43:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:35,650 INFO L93 Difference]: Finished difference Result 2942 states and 4136 transitions. [2019-09-08 12:43:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:35,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:35,653 INFO L225 Difference]: With dead ends: 2942 [2019-09-08 12:43:35,653 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:35,654 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:43:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2160 transitions. [2019-09-08 12:43:35,790 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2160 transitions. Word has length 116 [2019-09-08 12:43:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:35,790 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2160 transitions. [2019-09-08 12:43:35,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2160 transitions. [2019-09-08 12:43:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:35,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:35,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,793 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash 556512380, now seen corresponding path program 1 times [2019-09-08 12:43:35,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:35,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:35,972 INFO L134 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:35,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:35,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:35,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:35,974 INFO L87 Difference]: Start difference. First operand 1560 states and 2160 transitions. Second operand 9 states. [2019-09-08 12:43:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:40,206 INFO L93 Difference]: Finished difference Result 2860 states and 4011 transitions. [2019-09-08 12:43:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:40,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:40,210 INFO L225 Difference]: With dead ends: 2860 [2019-09-08 12:43:40,210 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:40,211 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:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2158 transitions. [2019-09-08 12:43:40,350 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2158 transitions. Word has length 116 [2019-09-08 12:43:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:40,351 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2158 transitions. [2019-09-08 12:43:40,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2158 transitions. [2019-09-08 12:43:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:40,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:40,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,352 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1704336596, now seen corresponding path program 1 times [2019-09-08 12:43:40,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:40,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:40,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:40,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:40,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:40,542 INFO L87 Difference]: Start difference. First operand 1560 states and 2158 transitions. Second operand 9 states. [2019-09-08 12:43:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:44,692 INFO L93 Difference]: Finished difference Result 2854 states and 4000 transitions. [2019-09-08 12:43:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:44,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:44,696 INFO L225 Difference]: With dead ends: 2854 [2019-09-08 12:43:44,696 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:44,697 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:43:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2156 transitions. [2019-09-08 12:43:44,843 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2156 transitions. Word has length 116 [2019-09-08 12:43:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:44,843 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2156 transitions. [2019-09-08 12:43:44,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2156 transitions. [2019-09-08 12:43:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:44,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:44,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,845 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash -980057416, now seen corresponding path program 1 times [2019-09-08 12:43:44,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:44,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:45,019 INFO L134 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:45,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:45,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:45,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:45,020 INFO L87 Difference]: Start difference. First operand 1560 states and 2156 transitions. Second operand 9 states. [2019-09-08 12:43:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:49,393 INFO L93 Difference]: Finished difference Result 2930 states and 4109 transitions. [2019-09-08 12:43:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:49,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:49,396 INFO L225 Difference]: With dead ends: 2930 [2019-09-08 12:43:49,396 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:43:49,397 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:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:43:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:43:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2154 transitions. [2019-09-08 12:43:49,553 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2154 transitions. Word has length 116 [2019-09-08 12:43:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:49,554 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2154 transitions. [2019-09-08 12:43:49,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2154 transitions. [2019-09-08 12:43:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:49,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:49,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,556 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1159862923, now seen corresponding path program 1 times [2019-09-08 12:43:49,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:49,727 INFO L134 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:49,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:49,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:49,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:49,729 INFO L87 Difference]: Start difference. First operand 1560 states and 2154 transitions. Second operand 9 states. [2019-09-08 12:43:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:53,861 INFO L93 Difference]: Finished difference Result 2856 states and 3997 transitions. [2019-09-08 12:43:53,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:53,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:53,865 INFO L225 Difference]: With dead ends: 2856 [2019-09-08 12:43:53,865 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:53,867 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:43:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2152 transitions. [2019-09-08 12:43:54,045 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2152 transitions. Word has length 116 [2019-09-08 12:43:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:54,045 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2152 transitions. [2019-09-08 12:43:54,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2152 transitions. [2019-09-08 12:43:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:54,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:54,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,047 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2120772525, now seen corresponding path program 1 times [2019-09-08 12:43:54,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:54,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:54,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:54,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:43:54,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:54,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:54,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:54,223 INFO L87 Difference]: Start difference. First operand 1560 states and 2152 transitions. Second operand 9 states. [2019-09-08 12:43:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:58,397 INFO L93 Difference]: Finished difference Result 2856 states and 3995 transitions. [2019-09-08 12:43:58,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:58,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:58,400 INFO L225 Difference]: With dead ends: 2856 [2019-09-08 12:43:58,400 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:43:58,401 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:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:43:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:43:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:43:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2150 transitions. [2019-09-08 12:43:58,551 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2150 transitions. Word has length 116 [2019-09-08 12:43:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:58,551 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2150 transitions. [2019-09-08 12:43:58,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2150 transitions. [2019-09-08 12:43:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:58,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:58,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,553 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash -386074985, now seen corresponding path program 1 times [2019-09-08 12:43:58,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:58,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:58,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:58,727 INFO L134 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,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:58,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:58,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:58,728 INFO L87 Difference]: Start difference. First operand 1560 states and 2150 transitions. Second operand 9 states. [2019-09-08 12:44:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:02,828 INFO L93 Difference]: Finished difference Result 2854 states and 3990 transitions. [2019-09-08 12:44:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:02,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:02,831 INFO L225 Difference]: With dead ends: 2854 [2019-09-08 12:44:02,831 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:02,832 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:44:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2148 transitions. [2019-09-08 12:44:02,986 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2148 transitions. Word has length 116 [2019-09-08 12:44:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:02,986 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2148 transitions. [2019-09-08 12:44:02,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2148 transitions. [2019-09-08 12:44:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:02,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:02,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,989 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1430130661, now seen corresponding path program 1 times [2019-09-08 12:44:02,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:02,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:03,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:03,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:03,174 INFO L87 Difference]: Start difference. First operand 1560 states and 2148 transitions. Second operand 9 states. [2019-09-08 12:44:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:06,984 INFO L93 Difference]: Finished difference Result 2856 states and 3989 transitions. [2019-09-08 12:44:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:06,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:06,987 INFO L225 Difference]: With dead ends: 2856 [2019-09-08 12:44:06,987 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:06,987 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:44:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2146 transitions. [2019-09-08 12:44:07,144 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2146 transitions. Word has length 116 [2019-09-08 12:44:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:07,144 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2146 transitions. [2019-09-08 12:44:07,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2146 transitions. [2019-09-08 12:44:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:07,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:07,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,146 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1127654609, now seen corresponding path program 1 times [2019-09-08 12:44:07,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:07,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:07,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:07,317 INFO L87 Difference]: Start difference. First operand 1560 states and 2146 transitions. Second operand 9 states. [2019-09-08 12:44:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:11,328 INFO L93 Difference]: Finished difference Result 2854 states and 3984 transitions. [2019-09-08 12:44:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:11,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:11,331 INFO L225 Difference]: With dead ends: 2854 [2019-09-08 12:44:11,332 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:11,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2144 transitions. [2019-09-08 12:44:11,492 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2144 transitions. Word has length 116 [2019-09-08 12:44:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:11,492 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2144 transitions. [2019-09-08 12:44:11,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2144 transitions. [2019-09-08 12:44:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:11,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:11,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,494 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1487567545, now seen corresponding path program 1 times [2019-09-08 12:44:11,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:11,642 INFO L134 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:11,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:11,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:11,643 INFO L87 Difference]: Start difference. First operand 1560 states and 2144 transitions. Second operand 9 states. [2019-09-08 12:44:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:15,921 INFO L93 Difference]: Finished difference Result 2854 states and 3982 transitions. [2019-09-08 12:44:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:15,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:15,924 INFO L225 Difference]: With dead ends: 2854 [2019-09-08 12:44:15,924 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:15,925 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:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2142 transitions. [2019-09-08 12:44:16,086 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2142 transitions. Word has length 116 [2019-09-08 12:44:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2142 transitions. [2019-09-08 12:44:16,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2142 transitions. [2019-09-08 12:44:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:16,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:16,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] [2019-09-08 12:44:16,088 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash -74026130, now seen corresponding path program 1 times [2019-09-08 12:44:16,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:16,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:16,235 INFO L134 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:16,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:16,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:16,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:16,236 INFO L87 Difference]: Start difference. First operand 1560 states and 2142 transitions. Second operand 9 states. [2019-09-08 12:44:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:20,012 INFO L93 Difference]: Finished difference Result 2920 states and 4073 transitions. [2019-09-08 12:44:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:20,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:20,016 INFO L225 Difference]: With dead ends: 2920 [2019-09-08 12:44:20,016 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:44:20,017 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:44:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:44:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:44:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2141 transitions. [2019-09-08 12:44:20,210 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2141 transitions. Word has length 116 [2019-09-08 12:44:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:20,210 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2141 transitions. [2019-09-08 12:44:20,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2141 transitions. [2019-09-08 12:44:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:20,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:20,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,212 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 749188713, now seen corresponding path program 1 times [2019-09-08 12:44:20,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:20,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:44:20,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:20,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:20,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:20,402 INFO L87 Difference]: Start difference. First operand 1560 states and 2141 transitions. Second operand 9 states. [2019-09-08 12:44:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:24,602 INFO L93 Difference]: Finished difference Result 2850 states and 3970 transitions. [2019-09-08 12:44:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:24,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:24,604 INFO L225 Difference]: With dead ends: 2850 [2019-09-08 12:44:24,606 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:24,608 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:44:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2140 transitions. [2019-09-08 12:44:24,774 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2140 transitions. Word has length 116 [2019-09-08 12:44:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:24,774 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2140 transitions. [2019-09-08 12:44:24,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2140 transitions. [2019-09-08 12:44:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:24,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:24,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,776 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1509419725, now seen corresponding path program 1 times [2019-09-08 12:44:24,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:24,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:24,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:24,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:24,935 INFO L87 Difference]: Start difference. First operand 1560 states and 2140 transitions. Second operand 9 states. [2019-09-08 12:44:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:28,978 INFO L93 Difference]: Finished difference Result 2846 states and 3965 transitions. [2019-09-08 12:44:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:28,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:28,982 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:44:28,982 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:28,983 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:44:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2139 transitions. [2019-09-08 12:44:29,152 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2139 transitions. Word has length 116 [2019-09-08 12:44:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:29,152 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2139 transitions. [2019-09-08 12:44:29,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2139 transitions. [2019-09-08 12:44:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:29,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:29,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,154 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -33750415, now seen corresponding path program 1 times [2019-09-08 12:44:29,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:29,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:29,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:29,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:29,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:29,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:29,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:29,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:29,312 INFO L87 Difference]: Start difference. First operand 1560 states and 2139 transitions. Second operand 9 states. [2019-09-08 12:44:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:33,708 INFO L93 Difference]: Finished difference Result 2850 states and 3968 transitions. [2019-09-08 12:44:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:33,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:33,712 INFO L225 Difference]: With dead ends: 2850 [2019-09-08 12:44:33,712 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:33,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2138 transitions. [2019-09-08 12:44:33,890 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2138 transitions. Word has length 116 [2019-09-08 12:44:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:33,890 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2138 transitions. [2019-09-08 12:44:33,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2138 transitions. [2019-09-08 12:44:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:33,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:33,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,892 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1458333846, now seen corresponding path program 1 times [2019-09-08 12:44:33,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:33,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:33,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:33,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:34,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:44:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:34,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:34,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:34,054 INFO L87 Difference]: Start difference. First operand 1560 states and 2138 transitions. Second operand 9 states. [2019-09-08 12:44:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:38,315 INFO L93 Difference]: Finished difference Result 2850 states and 3966 transitions. [2019-09-08 12:44:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:38,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:38,319 INFO L225 Difference]: With dead ends: 2850 [2019-09-08 12:44:38,319 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:38,320 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:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2137 transitions. [2019-09-08 12:44:38,494 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2137 transitions. Word has length 116 [2019-09-08 12:44:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:38,494 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2137 transitions. [2019-09-08 12:44:38,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2137 transitions. [2019-09-08 12:44:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:38,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:38,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] [2019-09-08 12:44:38,497 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 87186725, now seen corresponding path program 1 times [2019-09-08 12:44:38,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:38,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:38,655 INFO L134 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:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:38,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:38,656 INFO L87 Difference]: Start difference. First operand 1560 states and 2137 transitions. Second operand 9 states. [2019-09-08 12:44:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:42,611 INFO L93 Difference]: Finished difference Result 2846 states and 3960 transitions. [2019-09-08 12:44:42,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:42,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:42,615 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:44:42,615 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:42,617 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:44:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2136 transitions. [2019-09-08 12:44:42,830 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2136 transitions. Word has length 116 [2019-09-08 12:44:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:42,830 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2136 transitions. [2019-09-08 12:44:42,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2136 transitions. [2019-09-08 12:44:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:42,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:42,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,832 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 951350653, now seen corresponding path program 1 times [2019-09-08 12:44:42,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:42,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:42,994 INFO L134 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:42,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:42,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:42,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:42,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:42,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:42,995 INFO L87 Difference]: Start difference. First operand 1560 states and 2136 transitions. Second operand 9 states. [2019-09-08 12:44:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:47,331 INFO L93 Difference]: Finished difference Result 2846 states and 3959 transitions. [2019-09-08 12:44:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:47,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:47,335 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:44:47,335 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:47,336 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:44:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2135 transitions. [2019-09-08 12:44:47,514 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2135 transitions. Word has length 116 [2019-09-08 12:44:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:47,514 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2135 transitions. [2019-09-08 12:44:47,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2135 transitions. [2019-09-08 12:44:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:47,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:47,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,516 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1453998007, now seen corresponding path program 1 times [2019-09-08 12:44:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:47,659 INFO L134 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,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:47,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:47,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:47,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:47,660 INFO L87 Difference]: Start difference. First operand 1560 states and 2135 transitions. Second operand 9 states. [2019-09-08 12:44:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:51,968 INFO L93 Difference]: Finished difference Result 2850 states and 3960 transitions. [2019-09-08 12:44:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:51,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:51,971 INFO L225 Difference]: With dead ends: 2850 [2019-09-08 12:44:51,971 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:51,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2134 transitions. [2019-09-08 12:44:52,155 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2134 transitions. Word has length 116 [2019-09-08 12:44:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:52,155 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2134 transitions. [2019-09-08 12:44:52,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2134 transitions. [2019-09-08 12:44:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:52,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:52,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,157 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1382377518, now seen corresponding path program 1 times [2019-09-08 12:44:52,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:52,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:52,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:52,335 INFO L134 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:52,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:52,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:52,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:52,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:52,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:52,336 INFO L87 Difference]: Start difference. First operand 1560 states and 2134 transitions. Second operand 9 states. [2019-09-08 12:44:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:56,556 INFO L93 Difference]: Finished difference Result 2846 states and 3955 transitions. [2019-09-08 12:44:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:56,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:44:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:56,560 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:44:56,560 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:44:56,561 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:44:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:44:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:44:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:44:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2133 transitions. [2019-09-08 12:44:56,750 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2133 transitions. Word has length 116 [2019-09-08 12:44:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:56,750 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2133 transitions. [2019-09-08 12:44:56,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2133 transitions. [2019-09-08 12:44:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:44:56,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:56,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,752 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1499012870, now seen corresponding path program 1 times [2019-09-08 12:44:56,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:56,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:56,892 INFO L134 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:56,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:56,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:56,894 INFO L87 Difference]: Start difference. First operand 1560 states and 2133 transitions. Second operand 9 states. [2019-09-08 12:45:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:01,182 INFO L93 Difference]: Finished difference Result 2846 states and 3954 transitions. [2019-09-08 12:45:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:01,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:45:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:01,185 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:45:01,185 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:01,186 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:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2132 transitions. [2019-09-08 12:45:01,372 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2132 transitions. Word has length 116 [2019-09-08 12:45:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:01,373 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2132 transitions. [2019-09-08 12:45:01,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2132 transitions. [2019-09-08 12:45:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:45:01,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:01,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,375 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2079548236, now seen corresponding path program 1 times [2019-09-08 12:45:01,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:01,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:01,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:01,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:01,576 INFO L87 Difference]: Start difference. First operand 1560 states and 2132 transitions. Second operand 9 states. [2019-09-08 12:45:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:05,842 INFO L93 Difference]: Finished difference Result 2846 states and 3952 transitions. [2019-09-08 12:45:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:05,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:45:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:05,846 INFO L225 Difference]: With dead ends: 2846 [2019-09-08 12:45:05,846 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:05,847 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:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2131 transitions. [2019-09-08 12:45:06,041 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2131 transitions. Word has length 116 [2019-09-08 12:45:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:06,041 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2131 transitions. [2019-09-08 12:45:06,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2131 transitions. [2019-09-08 12:45:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:06,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:06,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] [2019-09-08 12:45:06,043 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash -812730032, now seen corresponding path program 1 times [2019-09-08 12:45:06,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:06,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:06,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:06,178 INFO L134 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:06,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:06,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:06,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:06,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:06,179 INFO L87 Difference]: Start difference. First operand 1560 states and 2131 transitions. Second operand 9 states. [2019-09-08 12:45:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:10,325 INFO L93 Difference]: Finished difference Result 2852 states and 3959 transitions. [2019-09-08 12:45:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:10,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:10,328 INFO L225 Difference]: With dead ends: 2852 [2019-09-08 12:45:10,328 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:10,329 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:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2129 transitions. [2019-09-08 12:45:10,528 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2129 transitions. Word has length 117 [2019-09-08 12:45:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:10,528 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2129 transitions. [2019-09-08 12:45:10,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2129 transitions. [2019-09-08 12:45:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:10,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:10,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] [2019-09-08 12:45:10,530 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:10,530 INFO L82 PathProgramCache]: Analyzing trace with hash 573664889, now seen corresponding path program 1 times [2019-09-08 12:45:10,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:10,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:10,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:10,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:45:10,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:10,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:10,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:10,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:10,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:10,684 INFO L87 Difference]: Start difference. First operand 1560 states and 2129 transitions. Second operand 9 states. [2019-09-08 12:45:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:14,915 INFO L93 Difference]: Finished difference Result 2844 states and 3946 transitions. [2019-09-08 12:45:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:14,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:14,918 INFO L225 Difference]: With dead ends: 2844 [2019-09-08 12:45:14,918 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:14,919 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:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2128 transitions. [2019-09-08 12:45:15,117 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2128 transitions. Word has length 117 [2019-09-08 12:45:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:15,117 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2128 transitions. [2019-09-08 12:45:15,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2128 transitions. [2019-09-08 12:45:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:15,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:15,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,119 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash -924609499, now seen corresponding path program 1 times [2019-09-08 12:45:15,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:15,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:15,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:15,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:15,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:15,264 INFO L134 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:15,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:15,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:15,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:15,265 INFO L87 Difference]: Start difference. First operand 1560 states and 2128 transitions. Second operand 9 states. [2019-09-08 12:45:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:19,443 INFO L93 Difference]: Finished difference Result 2845 states and 3946 transitions. [2019-09-08 12:45:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:19,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:19,447 INFO L225 Difference]: With dead ends: 2845 [2019-09-08 12:45:19,447 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:19,448 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:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2127 transitions. [2019-09-08 12:45:19,649 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2127 transitions. Word has length 117 [2019-09-08 12:45:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:19,649 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2127 transitions. [2019-09-08 12:45:19,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2127 transitions. [2019-09-08 12:45:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:19,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:19,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,651 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 735487223, now seen corresponding path program 1 times [2019-09-08 12:45:19,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:19,803 INFO L134 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,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:19,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:19,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:19,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:19,804 INFO L87 Difference]: Start difference. First operand 1560 states and 2127 transitions. Second operand 9 states. [2019-09-08 12:45:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:24,128 INFO L93 Difference]: Finished difference Result 2845 states and 3945 transitions. [2019-09-08 12:45:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:24,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:24,132 INFO L225 Difference]: With dead ends: 2845 [2019-09-08 12:45:24,132 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:24,133 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:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2126 transitions. [2019-09-08 12:45:24,333 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2126 transitions. Word has length 117 [2019-09-08 12:45:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2126 transitions. [2019-09-08 12:45:24,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2126 transitions. [2019-09-08 12:45:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:24,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:24,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,335 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1309027866, now seen corresponding path program 1 times [2019-09-08 12:45:24,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:24,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:24,489 INFO L134 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:24,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:24,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:24,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:24,490 INFO L87 Difference]: Start difference. First operand 1560 states and 2126 transitions. Second operand 9 states. [2019-09-08 12:45:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:28,672 INFO L93 Difference]: Finished difference Result 2845 states and 3944 transitions. [2019-09-08 12:45:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:28,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:28,675 INFO L225 Difference]: With dead ends: 2845 [2019-09-08 12:45:28,675 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:28,676 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:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2125 transitions. [2019-09-08 12:45:28,889 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2125 transitions. Word has length 117 [2019-09-08 12:45:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:28,889 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2125 transitions. [2019-09-08 12:45:28,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2125 transitions. [2019-09-08 12:45:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:45:28,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:28,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] [2019-09-08 12:45:28,890 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash 963957973, now seen corresponding path program 1 times [2019-09-08 12:45:28,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:28,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:28,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:28,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:29,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:29,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:29,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:29,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:29,049 INFO L87 Difference]: Start difference. First operand 1560 states and 2125 transitions. Second operand 9 states. [2019-09-08 12:45:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:33,177 INFO L93 Difference]: Finished difference Result 2844 states and 3941 transitions. [2019-09-08 12:45:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:33,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:45:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:33,179 INFO L225 Difference]: With dead ends: 2844 [2019-09-08 12:45:33,180 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:33,180 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:45:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2124 transitions. [2019-09-08 12:45:33,392 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2124 transitions. Word has length 117 [2019-09-08 12:45:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:33,392 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2124 transitions. [2019-09-08 12:45:33,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2124 transitions. [2019-09-08 12:45:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:33,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:33,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,394 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -208800668, now seen corresponding path program 1 times [2019-09-08 12:45:33,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:33,540 INFO L134 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,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:33,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:33,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:33,541 INFO L87 Difference]: Start difference. First operand 1560 states and 2124 transitions. Second operand 9 states. [2019-09-08 12:45:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:37,686 INFO L93 Difference]: Finished difference Result 2950 states and 4086 transitions. [2019-09-08 12:45:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:37,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:37,689 INFO L225 Difference]: With dead ends: 2950 [2019-09-08 12:45:37,689 INFO L226 Difference]: Without dead ends: 2720 [2019-09-08 12:45:37,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-08 12:45:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1560. [2019-09-08 12:45:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2122 transitions. [2019-09-08 12:45:37,902 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2122 transitions. Word has length 118 [2019-09-08 12:45:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:37,902 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2122 transitions. [2019-09-08 12:45:37,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2122 transitions. [2019-09-08 12:45:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:37,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:37,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,905 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2138110196, now seen corresponding path program 1 times [2019-09-08 12:45:37,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:37,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:38,056 INFO L134 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:38,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:38,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:38,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:38,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:38,057 INFO L87 Difference]: Start difference. First operand 1560 states and 2122 transitions. Second operand 9 states. [2019-09-08 12:45:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:42,133 INFO L93 Difference]: Finished difference Result 2862 states and 3959 transitions. [2019-09-08 12:45:42,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:42,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:42,136 INFO L225 Difference]: With dead ends: 2862 [2019-09-08 12:45:42,136 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:42,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2120 transitions. [2019-09-08 12:45:42,348 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2120 transitions. Word has length 118 [2019-09-08 12:45:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:42,349 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2120 transitions. [2019-09-08 12:45:42,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2120 transitions. [2019-09-08 12:45:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:42,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:42,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,350 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1445945460, now seen corresponding path program 1 times [2019-09-08 12:45:42,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:42,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:42,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:42,493 INFO L134 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:42,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:42,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:42,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:42,494 INFO L87 Difference]: Start difference. First operand 1560 states and 2120 transitions. Second operand 9 states. [2019-09-08 12:45:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:46,529 INFO L93 Difference]: Finished difference Result 2757 states and 3792 transitions. [2019-09-08 12:45:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:46,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:46,532 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:45:46,532 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:45:46,533 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:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:45:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:45:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2118 transitions. [2019-09-08 12:45:46,742 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2118 transitions. Word has length 118 [2019-09-08 12:45:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:46,742 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2118 transitions. [2019-09-08 12:45:46,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2118 transitions. [2019-09-08 12:45:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:46,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:46,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,745 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 754029191, now seen corresponding path program 1 times [2019-09-08 12:45:46,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:46,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:46,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:46,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:46,892 INFO L134 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,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:46,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:46,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:46,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:46,893 INFO L87 Difference]: Start difference. First operand 1560 states and 2118 transitions. Second operand 9 states. [2019-09-08 12:45:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:50,819 INFO L93 Difference]: Finished difference Result 2757 states and 3790 transitions. [2019-09-08 12:45:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:50,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:50,822 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:45:50,822 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:45:50,823 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:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:45:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:45:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2116 transitions. [2019-09-08 12:45:51,077 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2116 transitions. Word has length 118 [2019-09-08 12:45:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:51,077 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2116 transitions. [2019-09-08 12:45:51,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2116 transitions. [2019-09-08 12:45:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:51,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:51,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] [2019-09-08 12:45:51,079 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1464940831, now seen corresponding path program 1 times [2019-09-08 12:45:51,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:51,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:51,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:51,230 INFO L134 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:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:51,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:51,231 INFO L87 Difference]: Start difference. First operand 1560 states and 2116 transitions. Second operand 9 states. [2019-09-08 12:45:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:55,467 INFO L93 Difference]: Finished difference Result 2862 states and 3951 transitions. [2019-09-08 12:45:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:55,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:55,471 INFO L225 Difference]: With dead ends: 2862 [2019-09-08 12:45:55,471 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:45:55,472 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:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:45:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:45:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:45:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2114 transitions. [2019-09-08 12:45:55,693 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2114 transitions. Word has length 118 [2019-09-08 12:45:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:55,693 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2114 transitions. [2019-09-08 12:45:55,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2114 transitions. [2019-09-08 12:45:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:55,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:55,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,695 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1847544111, now seen corresponding path program 1 times [2019-09-08 12:45:55,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:55,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:55,855 INFO L134 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:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:55,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:55,857 INFO L87 Difference]: Start difference. First operand 1560 states and 2114 transitions. Second operand 9 states. [2019-09-08 12:45:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:59,894 INFO L93 Difference]: Finished difference Result 2757 states and 3786 transitions. [2019-09-08 12:45:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:59,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:59,897 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:45:59,897 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:45:59,898 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:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2112 transitions. [2019-09-08 12:46:00,120 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2112 transitions. Word has length 118 [2019-09-08 12:46:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:00,120 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2112 transitions. [2019-09-08 12:46:00,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2112 transitions. [2019-09-08 12:46:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:00,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:00,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] [2019-09-08 12:46:00,121 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -322706802, now seen corresponding path program 1 times [2019-09-08 12:46:00,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:00,269 INFO L134 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:00,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:00,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:00,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:00,270 INFO L87 Difference]: Start difference. First operand 1560 states and 2112 transitions. Second operand 9 states. [2019-09-08 12:46:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:04,347 INFO L93 Difference]: Finished difference Result 2753 states and 3777 transitions. [2019-09-08 12:46:04,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:04,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:04,350 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:04,350 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:04,350 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:46:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2110 transitions. [2019-09-08 12:46:04,578 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2110 transitions. Word has length 118 [2019-09-08 12:46:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:04,578 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2110 transitions. [2019-09-08 12:46:04,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2110 transitions. [2019-09-08 12:46:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:04,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:04,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,580 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash -594139473, now seen corresponding path program 1 times [2019-09-08 12:46:04,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:04,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:04,735 INFO L134 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,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:04,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:04,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:04,736 INFO L87 Difference]: Start difference. First operand 1560 states and 2110 transitions. Second operand 9 states. [2019-09-08 12:46:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:08,752 INFO L93 Difference]: Finished difference Result 2757 states and 3780 transitions. [2019-09-08 12:46:08,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:08,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:08,755 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:46:08,755 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:08,756 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:46:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2108 transitions. [2019-09-08 12:46:08,989 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2108 transitions. Word has length 118 [2019-09-08 12:46:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:08,989 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2108 transitions. [2019-09-08 12:46:08,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2108 transitions. [2019-09-08 12:46:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:08,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:08,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,991 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:08,992 INFO L82 PathProgramCache]: Analyzing trace with hash 116772167, now seen corresponding path program 1 times [2019-09-08 12:46:08,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:08,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:08,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:08,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:08,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:09,156 INFO L134 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:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:09,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:09,158 INFO L87 Difference]: Start difference. First operand 1560 states and 2108 transitions. Second operand 9 states. [2019-09-08 12:46:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:13,467 INFO L93 Difference]: Finished difference Result 2862 states and 3939 transitions. [2019-09-08 12:46:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:13,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:13,471 INFO L225 Difference]: With dead ends: 2862 [2019-09-08 12:46:13,471 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:46:13,472 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:46:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:46:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:46:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2106 transitions. [2019-09-08 12:46:13,708 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2106 transitions. Word has length 118 [2019-09-08 12:46:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:13,708 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2106 transitions. [2019-09-08 12:46:13,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2106 transitions. [2019-09-08 12:46:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:13,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:13,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] [2019-09-08 12:46:13,713 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1099254521, now seen corresponding path program 1 times [2019-09-08 12:46:13,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:13,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:13,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:13,883 INFO L87 Difference]: Start difference. First operand 1560 states and 2106 transitions. Second operand 9 states. [2019-09-08 12:46:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:18,043 INFO L93 Difference]: Finished difference Result 2757 states and 3776 transitions. [2019-09-08 12:46:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:18,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:18,046 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:46:18,046 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:18,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2104 transitions. [2019-09-08 12:46:18,282 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2104 transitions. Word has length 118 [2019-09-08 12:46:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:18,282 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2104 transitions. [2019-09-08 12:46:18,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2104 transitions. [2019-09-08 12:46:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:18,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:18,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,285 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1668525035, now seen corresponding path program 1 times [2019-09-08 12:46:18,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:18,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:18,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:18,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:18,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:18,464 INFO L134 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,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:18,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:18,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:18,465 INFO L87 Difference]: Start difference. First operand 1560 states and 2104 transitions. Second operand 9 states. [2019-09-08 12:46:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:22,696 INFO L93 Difference]: Finished difference Result 2753 states and 3767 transitions. [2019-09-08 12:46:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:22,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:22,698 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:22,698 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:22,699 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:46:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2102 transitions. [2019-09-08 12:46:22,935 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2102 transitions. Word has length 118 [2019-09-08 12:46:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:22,935 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2102 transitions. [2019-09-08 12:46:22,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2102 transitions. [2019-09-08 12:46:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:22,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:22,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,937 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:22,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1681841695, now seen corresponding path program 1 times [2019-09-08 12:46:22,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:22,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:23,083 INFO L134 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,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:23,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:23,084 INFO L87 Difference]: Start difference. First operand 1560 states and 2102 transitions. Second operand 9 states. [2019-09-08 12:46:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:27,284 INFO L93 Difference]: Finished difference Result 2757 states and 3770 transitions. [2019-09-08 12:46:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:27,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:27,287 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 12:46:27,287 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:27,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2100 transitions. [2019-09-08 12:46:27,532 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2100 transitions. Word has length 118 [2019-09-08 12:46:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:27,532 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2100 transitions. [2019-09-08 12:46:27,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2100 transitions. [2019-09-08 12:46:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:27,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:27,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,534 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -153450439, now seen corresponding path program 1 times [2019-09-08 12:46:27,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:27,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:27,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:27,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:27,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:27,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:27,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:27,685 INFO L87 Difference]: Start difference. First operand 1560 states and 2100 transitions. Second operand 9 states. [2019-09-08 12:46:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:31,880 INFO L93 Difference]: Finished difference Result 2753 states and 3761 transitions. [2019-09-08 12:46:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:31,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:31,883 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:31,883 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:31,884 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:46:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2098 transitions. [2019-09-08 12:46:32,129 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2098 transitions. Word has length 118 [2019-09-08 12:46:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:32,129 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2098 transitions. [2019-09-08 12:46:32,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2098 transitions. [2019-09-08 12:46:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:32,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:32,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,131 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1087362609, now seen corresponding path program 1 times [2019-09-08 12:46:32,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:32,274 INFO L134 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:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:32,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:32,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:32,276 INFO L87 Difference]: Start difference. First operand 1560 states and 2098 transitions. Second operand 9 states. [2019-09-08 12:46:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:36,331 INFO L93 Difference]: Finished difference Result 2753 states and 3759 transitions. [2019-09-08 12:46:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:36,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:36,333 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:36,333 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:36,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2096 transitions. [2019-09-08 12:46:36,576 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2096 transitions. Word has length 118 [2019-09-08 12:46:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:36,576 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2096 transitions. [2019-09-08 12:46:36,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2096 transitions. [2019-09-08 12:46:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:36,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:36,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,578 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 418974909, now seen corresponding path program 1 times [2019-09-08 12:46:36,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:36,751 INFO L134 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:36,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:36,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:36,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:36,752 INFO L87 Difference]: Start difference. First operand 1560 states and 2096 transitions. Second operand 9 states. [2019-09-08 12:46:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:40,858 INFO L93 Difference]: Finished difference Result 2689 states and 3659 transitions. [2019-09-08 12:46:40,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:40,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:40,861 INFO L225 Difference]: With dead ends: 2689 [2019-09-08 12:46:40,862 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:46:40,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:46:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:46:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2094 transitions. [2019-09-08 12:46:41,149 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2094 transitions. Word has length 118 [2019-09-08 12:46:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:41,150 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2094 transitions. [2019-09-08 12:46:41,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2094 transitions. [2019-09-08 12:46:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:41,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:41,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,151 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1927006555, now seen corresponding path program 1 times [2019-09-08 12:46:41,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:41,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:41,305 INFO L134 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:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:41,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:41,306 INFO L87 Difference]: Start difference. First operand 1560 states and 2094 transitions. Second operand 9 states. [2019-09-08 12:46:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:45,174 INFO L93 Difference]: Finished difference Result 2588 states and 3503 transitions. [2019-09-08 12:46:45,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:45,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:45,177 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 12:46:45,178 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:45,178 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:46:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2092 transitions. [2019-09-08 12:46:45,431 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2092 transitions. Word has length 118 [2019-09-08 12:46:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:45,431 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2092 transitions. [2019-09-08 12:46:45,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2092 transitions. [2019-09-08 12:46:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:45,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:45,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,433 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1553383728, now seen corresponding path program 1 times [2019-09-08 12:46:45,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:45,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:45,595 INFO L134 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:45,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:45,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:45,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:45,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:45,596 INFO L87 Difference]: Start difference. First operand 1560 states and 2092 transitions. Second operand 9 states. [2019-09-08 12:46:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:49,678 INFO L93 Difference]: Finished difference Result 2588 states and 3501 transitions. [2019-09-08 12:46:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:49,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:49,681 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 12:46:49,681 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:49,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:46:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2090 transitions. [2019-09-08 12:46:49,942 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2090 transitions. Word has length 118 [2019-09-08 12:46:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:49,942 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2090 transitions. [2019-09-08 12:46:49,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2090 transitions. [2019-09-08 12:46:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:49,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:49,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] [2019-09-08 12:46:49,944 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1853622763, now seen corresponding path program 1 times [2019-09-08 12:46:49,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:50,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:50,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:50,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:50,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:50,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:50,114 INFO L87 Difference]: Start difference. First operand 1560 states and 2090 transitions. Second operand 9 states. [2019-09-08 12:46:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:54,152 INFO L93 Difference]: Finished difference Result 2753 states and 3747 transitions. [2019-09-08 12:46:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:54,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:54,154 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:54,154 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:54,155 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:46:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2088 transitions. [2019-09-08 12:46:54,408 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2088 transitions. Word has length 118 [2019-09-08 12:46:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:54,409 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2088 transitions. [2019-09-08 12:46:54,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2088 transitions. [2019-09-08 12:46:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:54,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:54,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] [2019-09-08 12:46:54,410 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2037127334, now seen corresponding path program 1 times [2019-09-08 12:46:54,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:54,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:54,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:54,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:54,578 INFO L87 Difference]: Start difference. First operand 1560 states and 2088 transitions. Second operand 9 states. [2019-09-08 12:46:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:58,355 INFO L93 Difference]: Finished difference Result 2753 states and 3745 transitions. [2019-09-08 12:46:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:58,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:46:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:58,358 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:46:58,358 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:46:58,359 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:46:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:46:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:46:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:46:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2086 transitions. [2019-09-08 12:46:58,620 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2086 transitions. Word has length 118 [2019-09-08 12:46:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:58,620 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2086 transitions. [2019-09-08 12:46:58,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2086 transitions. [2019-09-08 12:46:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:46:58,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:58,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,622 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:58,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1738092808, now seen corresponding path program 1 times [2019-09-08 12:46:58,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:58,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:58,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:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:58,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:58,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:58,819 INFO L87 Difference]: Start difference. First operand 1560 states and 2086 transitions. Second operand 9 states. [2019-09-08 12:47:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:02,950 INFO L93 Difference]: Finished difference Result 2588 states and 3493 transitions. [2019-09-08 12:47:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:02,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:02,953 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 12:47:02,953 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:02,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2084 transitions. [2019-09-08 12:47:03,218 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2084 transitions. Word has length 118 [2019-09-08 12:47:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:03,218 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2084 transitions. [2019-09-08 12:47:03,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2084 transitions. [2019-09-08 12:47:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:03,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:03,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,220 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1612311026, now seen corresponding path program 1 times [2019-09-08 12:47:03,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:03,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:47:03,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:03,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:03,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:03,393 INFO L87 Difference]: Start difference. First operand 1560 states and 2084 transitions. Second operand 9 states. [2019-09-08 12:47:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:07,675 INFO L93 Difference]: Finished difference Result 2753 states and 3739 transitions. [2019-09-08 12:47:07,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:07,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:07,678 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:47:07,679 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:07,679 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:47:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2082 transitions. [2019-09-08 12:47:07,947 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2082 transitions. Word has length 118 [2019-09-08 12:47:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:07,947 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2082 transitions. [2019-09-08 12:47:07,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2082 transitions. [2019-09-08 12:47:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:07,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:07,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] [2019-09-08 12:47:07,949 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:07,949 INFO L82 PathProgramCache]: Analyzing trace with hash 475755850, now seen corresponding path program 1 times [2019-09-08 12:47:07,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:07,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:07,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:07,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:08,089 INFO L134 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:08,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:08,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:08,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:08,091 INFO L87 Difference]: Start difference. First operand 1560 states and 2082 transitions. Second operand 9 states. [2019-09-08 12:47:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:12,290 INFO L93 Difference]: Finished difference Result 2588 states and 3485 transitions. [2019-09-08 12:47:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:12,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:12,293 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 12:47:12,293 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:12,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2080 transitions. [2019-09-08 12:47:12,570 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2080 transitions. Word has length 118 [2019-09-08 12:47:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:12,571 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2080 transitions. [2019-09-08 12:47:12,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2080 transitions. [2019-09-08 12:47:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:12,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:12,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,573 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 179205810, now seen corresponding path program 1 times [2019-09-08 12:47:12,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:12,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:12,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:12,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:12,723 INFO L134 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:12,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:12,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:12,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:12,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:12,725 INFO L87 Difference]: Start difference. First operand 1560 states and 2080 transitions. Second operand 9 states. [2019-09-08 12:47:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:16,784 INFO L93 Difference]: Finished difference Result 2753 states and 3731 transitions. [2019-09-08 12:47:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:16,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:16,787 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:47:16,787 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:16,788 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:47:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2078 transitions. [2019-09-08 12:47:17,062 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2078 transitions. Word has length 118 [2019-09-08 12:47:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:17,062 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2078 transitions. [2019-09-08 12:47:17,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2078 transitions. [2019-09-08 12:47:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:17,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:17,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,065 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash -466323126, now seen corresponding path program 1 times [2019-09-08 12:47:17,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:17,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:17,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:17,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:17,247 INFO L134 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:17,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:17,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:17,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:17,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:17,248 INFO L87 Difference]: Start difference. First operand 1560 states and 2078 transitions. Second operand 9 states. [2019-09-08 12:47:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:21,448 INFO L93 Difference]: Finished difference Result 2753 states and 3729 transitions. [2019-09-08 12:47:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:21,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:21,453 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:47:21,454 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:21,455 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:47:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2076 transitions. [2019-09-08 12:47:21,765 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2076 transitions. Word has length 118 [2019-09-08 12:47:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:21,765 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2076 transitions. [2019-09-08 12:47:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2076 transitions. [2019-09-08 12:47:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:21,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:21,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,767 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:21,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:21,767 INFO L82 PathProgramCache]: Analyzing trace with hash 320877186, now seen corresponding path program 1 times [2019-09-08 12:47:21,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:21,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:21,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:21,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:21,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:47:21,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:21,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:21,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:21,915 INFO L87 Difference]: Start difference. First operand 1560 states and 2076 transitions. Second operand 9 states. [2019-09-08 12:47:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:25,973 INFO L93 Difference]: Finished difference Result 2753 states and 3725 transitions. [2019-09-08 12:47:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:25,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:25,975 INFO L225 Difference]: With dead ends: 2753 [2019-09-08 12:47:25,975 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:25,976 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:47:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2074 transitions. [2019-09-08 12:47:26,251 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2074 transitions. Word has length 118 [2019-09-08 12:47:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:26,252 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2074 transitions. [2019-09-08 12:47:26,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2074 transitions. [2019-09-08 12:47:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:26,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:26,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,253 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1391540718, now seen corresponding path program 1 times [2019-09-08 12:47:26,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:26,408 INFO L134 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:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:26,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:26,409 INFO L87 Difference]: Start difference. First operand 1560 states and 2074 transitions. Second operand 9 states. [2019-09-08 12:47:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:30,352 INFO L93 Difference]: Finished difference Result 2754 states and 3722 transitions. [2019-09-08 12:47:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:30,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:30,354 INFO L225 Difference]: With dead ends: 2754 [2019-09-08 12:47:30,355 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:30,355 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:47:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2073 transitions. [2019-09-08 12:47:30,638 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2073 transitions. Word has length 118 [2019-09-08 12:47:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:30,639 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2073 transitions. [2019-09-08 12:47:30,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2073 transitions. [2019-09-08 12:47:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:30,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:30,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:30,640 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash 539167429, now seen corresponding path program 1 times [2019-09-08 12:47:30,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:30,855 INFO L134 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:30,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:30,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:30,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:30,856 INFO L87 Difference]: Start difference. First operand 1560 states and 2073 transitions. Second operand 9 states. [2019-09-08 12:47:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:34,844 INFO L93 Difference]: Finished difference Result 2751 states and 3717 transitions. [2019-09-08 12:47:34,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:34,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:34,847 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:47:34,847 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:34,848 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:47:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2072 transitions. [2019-09-08 12:47:35,135 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2072 transitions. Word has length 118 [2019-09-08 12:47:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:35,135 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2072 transitions. [2019-09-08 12:47:35,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2072 transitions. [2019-09-08 12:47:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:35,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:35,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,137 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 385637555, now seen corresponding path program 1 times [2019-09-08 12:47:35,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:35,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:35,336 INFO L134 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:35,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:35,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:35,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:35,337 INFO L87 Difference]: Start difference. First operand 1560 states and 2072 transitions. Second operand 9 states. [2019-09-08 12:47:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:39,480 INFO L93 Difference]: Finished difference Result 2754 states and 3719 transitions. [2019-09-08 12:47:39,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:39,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:39,483 INFO L225 Difference]: With dead ends: 2754 [2019-09-08 12:47:39,483 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:39,484 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:47:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2071 transitions. [2019-09-08 12:47:39,781 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2071 transitions. Word has length 118 [2019-09-08 12:47:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:39,782 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2071 transitions. [2019-09-08 12:47:39,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2071 transitions. [2019-09-08 12:47:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:39,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:39,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,783 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1345092171, now seen corresponding path program 1 times [2019-09-08 12:47:39,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:39,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:47:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:39,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:39,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:39,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:39,932 INFO L87 Difference]: Start difference. First operand 1560 states and 2071 transitions. Second operand 9 states. [2019-09-08 12:47:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:43,754 INFO L93 Difference]: Finished difference Result 2855 states and 3870 transitions. [2019-09-08 12:47:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:43,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:43,757 INFO L225 Difference]: With dead ends: 2855 [2019-09-08 12:47:43,757 INFO L226 Difference]: Without dead ends: 2672 [2019-09-08 12:47:43,758 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:47:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-09-08 12:47:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1560. [2019-09-08 12:47:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2070 transitions. [2019-09-08 12:47:44,046 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2070 transitions. Word has length 118 [2019-09-08 12:47:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:44,046 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2070 transitions. [2019-09-08 12:47:44,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2070 transitions. [2019-09-08 12:47:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:44,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:44,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,048 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1644571880, now seen corresponding path program 1 times [2019-09-08 12:47:44,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:44,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:44,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:44,187 INFO L134 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,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:44,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:44,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:44,188 INFO L87 Difference]: Start difference. First operand 1560 states and 2070 transitions. Second operand 9 states. [2019-09-08 12:47:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:48,553 INFO L93 Difference]: Finished difference Result 2751 states and 3714 transitions. [2019-09-08 12:47:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:48,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:48,556 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:47:48,556 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:48,557 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:47:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2069 transitions. [2019-09-08 12:47:48,872 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2069 transitions. Word has length 118 [2019-09-08 12:47:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:48,872 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2069 transitions. [2019-09-08 12:47:48,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2069 transitions. [2019-09-08 12:47:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:48,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:48,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] [2019-09-08 12:47:48,873 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1190843286, now seen corresponding path program 1 times [2019-09-08 12:47:48,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:48,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:48,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:49,014 INFO L134 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:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:49,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:49,015 INFO L87 Difference]: Start difference. First operand 1560 states and 2069 transitions. Second operand 9 states. [2019-09-08 12:47:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:53,286 INFO L93 Difference]: Finished difference Result 2754 states and 3715 transitions. [2019-09-08 12:47:53,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:53,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:53,290 INFO L225 Difference]: With dead ends: 2754 [2019-09-08 12:47:53,291 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:53,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2068 transitions. [2019-09-08 12:47:53,592 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2068 transitions. Word has length 118 [2019-09-08 12:47:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:53,592 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2068 transitions. [2019-09-08 12:47:53,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2068 transitions. [2019-09-08 12:47:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:53,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:53,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,594 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:53,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash -423985998, now seen corresponding path program 1 times [2019-09-08 12:47:53,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:53,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:53,773 INFO L134 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:53,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:53,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:53,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:53,774 INFO L87 Difference]: Start difference. First operand 1560 states and 2068 transitions. Second operand 9 states. [2019-09-08 12:47:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:58,037 INFO L93 Difference]: Finished difference Result 2751 states and 3710 transitions. [2019-09-08 12:47:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:58,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:47:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:58,040 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:47:58,040 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:47:58,041 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:47:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:47:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:47:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:47:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2067 transitions. [2019-09-08 12:47:58,338 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2067 transitions. Word has length 118 [2019-09-08 12:47:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:58,338 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2067 transitions. [2019-09-08 12:47:58,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2067 transitions. [2019-09-08 12:47:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:47:58,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:58,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,340 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2034309521, now seen corresponding path program 1 times [2019-09-08 12:47:58,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:58,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:58,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:58,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:47:58,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:58,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:58,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:58,478 INFO L87 Difference]: Start difference. First operand 1560 states and 2067 transitions. Second operand 9 states. [2019-09-08 12:48:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:02,794 INFO L93 Difference]: Finished difference Result 2754 states and 3712 transitions. [2019-09-08 12:48:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:02,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:02,797 INFO L225 Difference]: With dead ends: 2754 [2019-09-08 12:48:02,797 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:02,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2066 transitions. [2019-09-08 12:48:03,105 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2066 transitions. Word has length 118 [2019-09-08 12:48:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:03,106 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2066 transitions. [2019-09-08 12:48:03,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2066 transitions. [2019-09-08 12:48:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:03,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:03,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,107 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 648178922, now seen corresponding path program 1 times [2019-09-08 12:48:03,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:03,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:03,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:48:03,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:03,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:03,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:03,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:03,259 INFO L87 Difference]: Start difference. First operand 1560 states and 2066 transitions. Second operand 9 states. [2019-09-08 12:48:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:07,571 INFO L93 Difference]: Finished difference Result 2751 states and 3707 transitions. [2019-09-08 12:48:07,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:07,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:07,574 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:07,574 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:07,574 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:48:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2065 transitions. [2019-09-08 12:48:07,883 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2065 transitions. Word has length 118 [2019-09-08 12:48:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:07,883 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2065 transitions. [2019-09-08 12:48:07,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2065 transitions. [2019-09-08 12:48:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:07,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:07,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] [2019-09-08 12:48:07,884 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1578230496, now seen corresponding path program 1 times [2019-09-08 12:48:07,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:07,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:07,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:08,040 INFO L134 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:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:08,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:08,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:08,041 INFO L87 Difference]: Start difference. First operand 1560 states and 2065 transitions. Second operand 9 states. [2019-09-08 12:48:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:12,343 INFO L93 Difference]: Finished difference Result 2751 states and 3706 transitions. [2019-09-08 12:48:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:12,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:12,346 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:12,346 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:12,347 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:48:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2064 transitions. [2019-09-08 12:48:12,665 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2064 transitions. Word has length 118 [2019-09-08 12:48:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:12,666 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2064 transitions. [2019-09-08 12:48:12,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2064 transitions. [2019-09-08 12:48:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:12,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:12,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,667 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1200797960, now seen corresponding path program 1 times [2019-09-08 12:48:12,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:12,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:12,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:12,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:12,816 INFO L87 Difference]: Start difference. First operand 1560 states and 2064 transitions. Second operand 9 states. [2019-09-08 12:48:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:17,104 INFO L93 Difference]: Finished difference Result 2751 states and 3704 transitions. [2019-09-08 12:48:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:17,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:17,107 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:17,107 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:17,108 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:48:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2063 transitions. [2019-09-08 12:48:17,419 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2063 transitions. Word has length 118 [2019-09-08 12:48:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:17,420 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2063 transitions. [2019-09-08 12:48:17,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2063 transitions. [2019-09-08 12:48:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:17,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:17,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,421 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2097184270, now seen corresponding path program 1 times [2019-09-08 12:48:17,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:17,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:17,558 INFO L134 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:17,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:17,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:17,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:17,559 INFO L87 Difference]: Start difference. First operand 1560 states and 2063 transitions. Second operand 9 states. [2019-09-08 12:48:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:21,922 INFO L93 Difference]: Finished difference Result 2588 states and 3454 transitions. [2019-09-08 12:48:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:21,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:21,925 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 12:48:21,925 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:21,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2062 transitions. [2019-09-08 12:48:22,240 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2062 transitions. Word has length 118 [2019-09-08 12:48:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:22,240 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2062 transitions. [2019-09-08 12:48:22,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2062 transitions. [2019-09-08 12:48:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:22,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:22,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,241 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1406663220, now seen corresponding path program 1 times [2019-09-08 12:48:22,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:22,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:22,394 INFO L134 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:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:22,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:22,395 INFO L87 Difference]: Start difference. First operand 1560 states and 2062 transitions. Second operand 9 states. [2019-09-08 12:48:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:26,675 INFO L93 Difference]: Finished difference Result 2751 states and 3700 transitions. [2019-09-08 12:48:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:26,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:26,678 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:26,679 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:26,680 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:48:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2061 transitions. [2019-09-08 12:48:27,043 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2061 transitions. Word has length 118 [2019-09-08 12:48:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:27,044 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2061 transitions. [2019-09-08 12:48:27,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2061 transitions. [2019-09-08 12:48:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:27,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:27,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,045 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1217019593, now seen corresponding path program 1 times [2019-09-08 12:48:27,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:27,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:48:27,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:27,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:27,184 INFO L87 Difference]: Start difference. First operand 1560 states and 2061 transitions. Second operand 9 states. [2019-09-08 12:48:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:31,350 INFO L93 Difference]: Finished difference Result 2751 states and 3699 transitions. [2019-09-08 12:48:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:31,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:31,353 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:31,353 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:31,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2060 transitions. [2019-09-08 12:48:31,673 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2060 transitions. Word has length 118 [2019-09-08 12:48:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:31,673 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2060 transitions. [2019-09-08 12:48:31,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2060 transitions. [2019-09-08 12:48:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:31,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:31,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,674 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash 478075713, now seen corresponding path program 1 times [2019-09-08 12:48:31,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:31,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:31,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:31,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:31,829 INFO L87 Difference]: Start difference. First operand 1560 states and 2060 transitions. Second operand 9 states. [2019-09-08 12:48:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:36,060 INFO L93 Difference]: Finished difference Result 2751 states and 3697 transitions. [2019-09-08 12:48:36,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:36,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:36,063 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:36,063 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:36,064 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:48:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2059 transitions. [2019-09-08 12:48:36,388 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2059 transitions. Word has length 118 [2019-09-08 12:48:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:36,389 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2059 transitions. [2019-09-08 12:48:36,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2059 transitions. [2019-09-08 12:48:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:48:36,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:36,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,390 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -635529681, now seen corresponding path program 1 times [2019-09-08 12:48:36,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:36,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:36,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:36,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:36,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:36,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:48:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:36,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:36,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:36,532 INFO L87 Difference]: Start difference. First operand 1560 states and 2059 transitions. Second operand 9 states. [2019-09-08 12:48:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:40,829 INFO L93 Difference]: Finished difference Result 2751 states and 3695 transitions. [2019-09-08 12:48:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:40,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:48:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:40,831 INFO L225 Difference]: With dead ends: 2751 [2019-09-08 12:48:40,831 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:40,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2058 transitions. [2019-09-08 12:48:41,163 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2058 transitions. Word has length 118 [2019-09-08 12:48:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:41,163 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2058 transitions. [2019-09-08 12:48:41,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2058 transitions. [2019-09-08 12:48:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:48:41,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:41,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,165 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -688808580, now seen corresponding path program 1 times [2019-09-08 12:48:41,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:41,304 INFO L134 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:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:41,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:41,305 INFO L87 Difference]: Start difference. First operand 1560 states and 2058 transitions. Second operand 9 states. [2019-09-08 12:48:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:45,495 INFO L93 Difference]: Finished difference Result 2749 states and 3691 transitions. [2019-09-08 12:48:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:45,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:48:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:45,497 INFO L225 Difference]: With dead ends: 2749 [2019-09-08 12:48:45,497 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 12:48:45,498 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:48:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 12:48:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1560. [2019-09-08 12:48:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 12:48:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2056 transitions. [2019-09-08 12:48:45,823 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2056 transitions. Word has length 119 [2019-09-08 12:48:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:45,823 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2056 transitions. [2019-09-08 12:48:45,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2056 transitions. [2019-09-08 12:48:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:48:45,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:45,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,825 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2040647731, now seen corresponding path program 1 times [2019-09-08 12:48:45,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:45,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:45,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:45,971 INFO L134 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:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:45,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:45,973 INFO L87 Difference]: Start difference. First operand 1560 states and 2056 transitions. Second operand 9 states. [2019-09-08 12:48:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:49,938 INFO L93 Difference]: Finished difference Result 2749 states and 3689 transitions. [2019-09-08 12:48:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:49,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:48:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:49,941 INFO L225 Difference]: With dead ends: 2749 [2019-09-08 12:48:49,941 INFO L226 Difference]: Without dead ends: 2581 [2019-09-08 12:48:49,942 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:48:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2019-09-08 12:48:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 1558. [2019-09-08 12:48:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-09-08 12:48:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2052 transitions. [2019-09-08 12:48:50,273 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2052 transitions. Word has length 119 [2019-09-08 12:48:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:50,273 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 2052 transitions. [2019-09-08 12:48:50,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2052 transitions. [2019-09-08 12:48:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:48:50,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:50,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,275 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1341127525, now seen corresponding path program 1 times [2019-09-08 12:48:50,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:50,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:50,468 INFO L134 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:50,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:50,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:50,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:50,470 INFO L87 Difference]: Start difference. First operand 1558 states and 2052 transitions. Second operand 9 states. [2019-09-08 12:48:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:54,636 INFO L93 Difference]: Finished difference Result 2747 states and 3685 transitions. [2019-09-08 12:48:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:54,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:48:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:54,640 INFO L225 Difference]: With dead ends: 2747 [2019-09-08 12:48:54,640 INFO L226 Difference]: Without dead ends: 2579 [2019-09-08 12:48:54,641 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:48:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2019-09-08 12:48:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 1556. [2019-09-08 12:48:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-09-08 12:48:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2048 transitions. [2019-09-08 12:48:54,976 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2048 transitions. Word has length 119 [2019-09-08 12:48:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:54,977 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2048 transitions. [2019-09-08 12:48:54,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2048 transitions. [2019-09-08 12:48:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:48:54,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:54,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,979 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1616260075, now seen corresponding path program 1 times [2019-09-08 12:48:54,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:54,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:54,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:55,139 INFO L134 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,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:55,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:55,140 INFO L87 Difference]: Start difference. First operand 1556 states and 2048 transitions. Second operand 9 states. [2019-09-08 12:48:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:59,340 INFO L93 Difference]: Finished difference Result 2743 states and 3679 transitions. [2019-09-08 12:48:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:59,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:48:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:59,342 INFO L225 Difference]: With dead ends: 2743 [2019-09-08 12:48:59,343 INFO L226 Difference]: Without dead ends: 2575 [2019-09-08 12:48:59,343 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:48:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-09-08 12:48:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1554. [2019-09-08 12:48:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-09-08 12:48:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2044 transitions. [2019-09-08 12:48:59,680 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2044 transitions. Word has length 119 [2019-09-08 12:48:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:59,680 INFO L475 AbstractCegarLoop]: Abstraction has 1554 states and 2044 transitions. [2019-09-08 12:48:59,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2044 transitions. [2019-09-08 12:48:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:48:59,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:59,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,682 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -617713502, now seen corresponding path program 1 times [2019-09-08 12:48:59,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:59,834 INFO L134 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:59,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:59,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:59,835 INFO L87 Difference]: Start difference. First operand 1554 states and 2044 transitions. Second operand 9 states. [2019-09-08 12:49:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:03,896 INFO L93 Difference]: Finished difference Result 2743 states and 3675 transitions. [2019-09-08 12:49:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:03,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:03,899 INFO L225 Difference]: With dead ends: 2743 [2019-09-08 12:49:03,899 INFO L226 Difference]: Without dead ends: 2575 [2019-09-08 12:49:03,900 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:49:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-09-08 12:49:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1554. [2019-09-08 12:49:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-09-08 12:49:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2042 transitions. [2019-09-08 12:49:04,237 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2042 transitions. Word has length 119 [2019-09-08 12:49:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:04,237 INFO L475 AbstractCegarLoop]: Abstraction has 1554 states and 2042 transitions. [2019-09-08 12:49:04,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2042 transitions. [2019-09-08 12:49:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:04,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:04,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:04,239 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1025934211, now seen corresponding path program 1 times [2019-09-08 12:49:04,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:04,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:04,406 INFO L134 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,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:04,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:04,407 INFO L87 Difference]: Start difference. First operand 1554 states and 2042 transitions. Second operand 9 states. [2019-09-08 12:49:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:08,603 INFO L93 Difference]: Finished difference Result 2741 states and 3671 transitions. [2019-09-08 12:49:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:08,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:08,606 INFO L225 Difference]: With dead ends: 2741 [2019-09-08 12:49:08,606 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:08,607 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:49:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2038 transitions. [2019-09-08 12:49:08,961 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2038 transitions. Word has length 119 [2019-09-08 12:49:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:08,962 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2038 transitions. [2019-09-08 12:49:08,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2038 transitions. [2019-09-08 12:49:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:08,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:08,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,963 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -822486861, now seen corresponding path program 1 times [2019-09-08 12:49:08,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:09,111 INFO L134 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,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:09,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:09,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:09,113 INFO L87 Difference]: Start difference. First operand 1552 states and 2038 transitions. Second operand 9 states. [2019-09-08 12:49:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:13,159 INFO L93 Difference]: Finished difference Result 2739 states and 3667 transitions. [2019-09-08 12:49:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:13,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:13,162 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:49:13,162 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:13,163 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:49:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2037 transitions. [2019-09-08 12:49:14,126 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2037 transitions. Word has length 119 [2019-09-08 12:49:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:14,126 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2037 transitions. [2019-09-08 12:49:14,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2037 transitions. [2019-09-08 12:49:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:14,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:14,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,127 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash -231209638, now seen corresponding path program 1 times [2019-09-08 12:49:14,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:14,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:14,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:14,272 INFO L134 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:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:14,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:14,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:14,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:14,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:14,273 INFO L87 Difference]: Start difference. First operand 1552 states and 2037 transitions. Second operand 9 states. [2019-09-08 12:49:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:18,382 INFO L93 Difference]: Finished difference Result 2739 states and 3666 transitions. [2019-09-08 12:49:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:18,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:18,385 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:49:18,385 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:18,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2036 transitions. [2019-09-08 12:49:18,735 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2036 transitions. Word has length 119 [2019-09-08 12:49:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:18,735 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2036 transitions. [2019-09-08 12:49:18,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2036 transitions. [2019-09-08 12:49:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:18,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:18,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,737 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1955034558, now seen corresponding path program 1 times [2019-09-08 12:49:18,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:18,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:18,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:18,875 INFO L134 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:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:18,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:18,876 INFO L87 Difference]: Start difference. First operand 1552 states and 2036 transitions. Second operand 9 states. [2019-09-08 12:49:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:23,159 INFO L93 Difference]: Finished difference Result 2739 states and 3665 transitions. [2019-09-08 12:49:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:23,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:23,162 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:49:23,162 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:23,163 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:49:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2035 transitions. [2019-09-08 12:49:23,515 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2035 transitions. Word has length 119 [2019-09-08 12:49:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:23,516 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2035 transitions. [2019-09-08 12:49:23,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2035 transitions. [2019-09-08 12:49:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:23,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:23,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,517 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2075300678, now seen corresponding path program 1 times [2019-09-08 12:49:23,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:23,670 INFO L134 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:23,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:23,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:23,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:23,671 INFO L87 Difference]: Start difference. First operand 1552 states and 2035 transitions. Second operand 9 states. [2019-09-08 12:49:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:27,355 INFO L93 Difference]: Finished difference Result 2740 states and 3665 transitions. [2019-09-08 12:49:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:27,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:27,358 INFO L225 Difference]: With dead ends: 2740 [2019-09-08 12:49:27,358 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:27,359 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:49:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2034 transitions. [2019-09-08 12:49:27,715 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2034 transitions. Word has length 119 [2019-09-08 12:49:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:27,716 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2034 transitions. [2019-09-08 12:49:27,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2034 transitions. [2019-09-08 12:49:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:27,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:27,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,717 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1092440276, now seen corresponding path program 1 times [2019-09-08 12:49:27,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:27,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:27,869 INFO L134 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:27,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:27,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:27,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:27,870 INFO L87 Difference]: Start difference. First operand 1552 states and 2034 transitions. Second operand 9 states. [2019-09-08 12:49:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:32,119 INFO L93 Difference]: Finished difference Result 2739 states and 3663 transitions. [2019-09-08 12:49:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:32,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:32,122 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:49:32,122 INFO L226 Difference]: Without dead ends: 2573 [2019-09-08 12:49:32,123 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:49:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-09-08 12:49:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1552. [2019-09-08 12:49:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:49:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2033 transitions. [2019-09-08 12:49:32,492 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2033 transitions. Word has length 119 [2019-09-08 12:49:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:32,492 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2033 transitions. [2019-09-08 12:49:32,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2033 transitions. [2019-09-08 12:49:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:32,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:32,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] [2019-09-08 12:49:32,493 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1830502960, now seen corresponding path program 1 times [2019-09-08 12:49:32,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:32,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:32,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:32,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:32,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:32,645 INFO L87 Difference]: Start difference. First operand 1552 states and 2033 transitions. Second operand 9 states. [2019-09-08 12:49:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:36,679 INFO L93 Difference]: Finished difference Result 2739 states and 3661 transitions. [2019-09-08 12:49:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:36,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:36,683 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:49:36,683 INFO L226 Difference]: Without dead ends: 2572 [2019-09-08 12:49:36,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-08 12:49:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1551. [2019-09-08 12:49:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-09-08 12:49:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2031 transitions. [2019-09-08 12:49:37,083 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2031 transitions. Word has length 119 [2019-09-08 12:49:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:37,083 INFO L475 AbstractCegarLoop]: Abstraction has 1551 states and 2031 transitions. [2019-09-08 12:49:37,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2031 transitions. [2019-09-08 12:49:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:37,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:37,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,085 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1701262560, now seen corresponding path program 1 times [2019-09-08 12:49:37,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:37,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:37,237 INFO L134 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,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:37,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:37,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:37,238 INFO L87 Difference]: Start difference. First operand 1551 states and 2031 transitions. Second operand 9 states. [2019-09-08 12:49:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:41,308 INFO L93 Difference]: Finished difference Result 2737 states and 3658 transitions. [2019-09-08 12:49:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:41,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:41,312 INFO L225 Difference]: With dead ends: 2737 [2019-09-08 12:49:41,312 INFO L226 Difference]: Without dead ends: 2570 [2019-09-08 12:49:41,313 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:49:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-08 12:49:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 1550. [2019-09-08 12:49:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:49:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2029 transitions. [2019-09-08 12:49:41,674 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2029 transitions. Word has length 119 [2019-09-08 12:49:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:41,674 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2029 transitions. [2019-09-08 12:49:41,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2029 transitions. [2019-09-08 12:49:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:41,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:41,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,675 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1550914094, now seen corresponding path program 1 times [2019-09-08 12:49:41,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:41,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:41,816 INFO L134 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:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:41,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:41,817 INFO L87 Difference]: Start difference. First operand 1550 states and 2029 transitions. Second operand 9 states. [2019-09-08 12:49:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:45,610 INFO L93 Difference]: Finished difference Result 2737 states and 3656 transitions. [2019-09-08 12:49:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:45,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:45,613 INFO L225 Difference]: With dead ends: 2737 [2019-09-08 12:49:45,613 INFO L226 Difference]: Without dead ends: 2570 [2019-09-08 12:49:45,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-08 12:49:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 1550. [2019-09-08 12:49:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:49:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2028 transitions. [2019-09-08 12:49:45,974 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2028 transitions. Word has length 119 [2019-09-08 12:49:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:45,974 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2028 transitions. [2019-09-08 12:49:45,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2028 transitions. [2019-09-08 12:49:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:45,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:45,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,976 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1775273992, now seen corresponding path program 1 times [2019-09-08 12:49:45,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:46,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:46,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:46,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:46,114 INFO L87 Difference]: Start difference. First operand 1550 states and 2028 transitions. Second operand 9 states. [2019-09-08 12:49:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:50,351 INFO L93 Difference]: Finished difference Result 2736 states and 3654 transitions. [2019-09-08 12:49:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:50,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:50,354 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:49:50,354 INFO L226 Difference]: Without dead ends: 2569 [2019-09-08 12:49:50,355 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:49:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-09-08 12:49:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1549. [2019-09-08 12:49:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-09-08 12:49:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2026 transitions. [2019-09-08 12:49:50,717 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2026 transitions. Word has length 119 [2019-09-08 12:49:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:50,717 INFO L475 AbstractCegarLoop]: Abstraction has 1549 states and 2026 transitions. [2019-09-08 12:49:50,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2026 transitions. [2019-09-08 12:49:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:50,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:50,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] [2019-09-08 12:49:50,719 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1010961526, now seen corresponding path program 1 times [2019-09-08 12:49:50,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:50,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:50,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:50,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:49:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:50,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:50,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:50,861 INFO L87 Difference]: Start difference. First operand 1549 states and 2026 transitions. Second operand 9 states. [2019-09-08 12:49:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:55,057 INFO L93 Difference]: Finished difference Result 2735 states and 3652 transitions. [2019-09-08 12:49:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:55,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:49:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:55,060 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:49:55,061 INFO L226 Difference]: Without dead ends: 2568 [2019-09-08 12:49:55,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-09-08 12:49:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1548. [2019-09-08 12:49:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-09-08 12:49:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2024 transitions. [2019-09-08 12:49:55,486 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2024 transitions. Word has length 119 [2019-09-08 12:49:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:55,486 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2024 transitions. [2019-09-08 12:49:55,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2024 transitions. [2019-09-08 12:49:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:49:55,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:55,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,488 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1829392270, now seen corresponding path program 1 times [2019-09-08 12:49:55,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:55,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:55,641 INFO L134 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:55,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:55,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:55,642 INFO L87 Difference]: Start difference. First operand 1548 states and 2024 transitions. Second operand 9 states. [2019-09-08 12:50:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:00,013 INFO L93 Difference]: Finished difference Result 2733 states and 3649 transitions. [2019-09-08 12:50:00,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:00,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:00,016 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:50:00,016 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 12:50:00,017 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:50:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 12:50:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1547. [2019-09-08 12:50:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:50:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2022 transitions. [2019-09-08 12:50:00,394 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2022 transitions. Word has length 119 [2019-09-08 12:50:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:00,395 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2022 transitions. [2019-09-08 12:50:00,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2022 transitions. [2019-09-08 12:50:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:50:00,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:00,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,396 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash -750483798, now seen corresponding path program 1 times [2019-09-08 12:50:00,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:00,547 INFO L134 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:50:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:00,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:00,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:00,548 INFO L87 Difference]: Start difference. First operand 1547 states and 2022 transitions. Second operand 9 states. [2019-09-08 12:50:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:04,726 INFO L93 Difference]: Finished difference Result 2733 states and 3647 transitions. [2019-09-08 12:50:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:04,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:04,729 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:50:04,729 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 12:50:04,730 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:50:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 12:50:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1547. [2019-09-08 12:50:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:50:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2021 transitions. [2019-09-08 12:50:05,117 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2021 transitions. Word has length 119 [2019-09-08 12:50:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:05,117 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2021 transitions. [2019-09-08 12:50:05,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2021 transitions. [2019-09-08 12:50:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:50:05,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:05,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,119 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1258941311, now seen corresponding path program 1 times [2019-09-08 12:50:05,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:05,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:05,271 INFO L134 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:50:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:05,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:05,273 INFO L87 Difference]: Start difference. First operand 1547 states and 2021 transitions. Second operand 9 states. [2019-09-08 12:50:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:09,719 INFO L93 Difference]: Finished difference Result 2731 states and 3644 transitions. [2019-09-08 12:50:09,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:09,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:09,722 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:50:09,722 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 12:50:09,723 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:50:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 12:50:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1546. [2019-09-08 12:50:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-09-08 12:50:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2019 transitions. [2019-09-08 12:50:10,106 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2019 transitions. Word has length 119 [2019-09-08 12:50:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:10,106 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2019 transitions. [2019-09-08 12:50:10,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2019 transitions. [2019-09-08 12:50:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:50:10,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:10,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,108 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911234, now seen corresponding path program 1 times [2019-09-08 12:50:10,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:10,264 INFO L134 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:50:10,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:10,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:10,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:10,265 INFO L87 Difference]: Start difference. First operand 1546 states and 2019 transitions. Second operand 9 states. [2019-09-08 12:50:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:14,433 INFO L93 Difference]: Finished difference Result 2731 states and 3642 transitions. [2019-09-08 12:50:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:14,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:14,435 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:50:14,435 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 12:50:14,436 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:50:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 12:50:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1546. [2019-09-08 12:50:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-09-08 12:50:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2018 transitions. [2019-09-08 12:50:14,837 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2018 transitions. Word has length 119 [2019-09-08 12:50:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:14,837 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2018 transitions. [2019-09-08 12:50:14,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2018 transitions. [2019-09-08 12:50:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:50:14,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:14,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:14,839 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 873212378, now seen corresponding path program 1 times [2019-09-08 12:50:14,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:14,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:14,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:14,997 INFO L134 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:50:14,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:14,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:14,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:14,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:14,998 INFO L87 Difference]: Start difference. First operand 1546 states and 2018 transitions. Second operand 9 states. [2019-09-08 12:50:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:19,394 INFO L93 Difference]: Finished difference Result 2731 states and 3641 transitions. [2019-09-08 12:50:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:19,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:19,398 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:50:19,398 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 12:50:19,399 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:50:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 12:50:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1546. [2019-09-08 12:50:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-09-08 12:50:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2017 transitions. [2019-09-08 12:50:19,805 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2017 transitions. Word has length 119 [2019-09-08 12:50:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:19,805 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2017 transitions. [2019-09-08 12:50:19,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2017 transitions. [2019-09-08 12:50:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:50:19,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:19,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:19,807 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1418689760, now seen corresponding path program 1 times [2019-09-08 12:50:19,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:19,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:19,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:19,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:19,948 INFO L134 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:50:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:19,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:19,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:19,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:19,949 INFO L87 Difference]: Start difference. First operand 1546 states and 2017 transitions. Second operand 9 states. [2019-09-08 12:50:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:24,287 INFO L93 Difference]: Finished difference Result 2699 states and 3588 transitions. [2019-09-08 12:50:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:24,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:50:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:24,291 INFO L225 Difference]: With dead ends: 2699 [2019-09-08 12:50:24,291 INFO L226 Difference]: Without dead ends: 2533 [2019-09-08 12:50:24,292 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:50:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2019-09-08 12:50:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1549. [2019-09-08 12:50:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-09-08 12:50:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2021 transitions. [2019-09-08 12:50:24,695 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2021 transitions. Word has length 119 [2019-09-08 12:50:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:24,696 INFO L475 AbstractCegarLoop]: Abstraction has 1549 states and 2021 transitions. [2019-09-08 12:50:24,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2021 transitions. [2019-09-08 12:50:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:50:24,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:24,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,697 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1112718529, now seen corresponding path program 1 times [2019-09-08 12:50:24,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:26,012 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 12:50:26,166 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 12:50:26,332 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:50:26,502 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 12:50:26,668 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-08 12:50:26,825 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-08 12:50:27,031 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:50:28,552 INFO L134 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:50:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:50:28,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:50:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:50:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:50:28,553 INFO L87 Difference]: Start difference. First operand 1549 states and 2021 transitions. Second operand 36 states. [2019-09-08 12:50:28,814 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:50:30,176 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:50:30,392 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 12:50:30,618 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:50:31,350 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:50:31,770 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-08 12:50:32,229 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-08 12:50:32,733 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 97 [2019-09-08 12:50:33,297 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 106 [2019-09-08 12:50:34,001 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 125 [2019-09-08 12:50:34,358 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-09-08 12:50:34,711 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-09-08 12:50:35,093 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-09-08 12:51:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:01,759 INFO L93 Difference]: Finished difference Result 2478 states and 3267 transitions. [2019-09-08 12:51:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:51:01,760 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 120 [2019-09-08 12:51:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:01,763 INFO L225 Difference]: With dead ends: 2478 [2019-09-08 12:51:01,763 INFO L226 Difference]: Without dead ends: 2308 [2019-09-08 12:51:01,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=597, Invalid=2595, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 12:51:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2019-09-08 12:51:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 1574. [2019-09-08 12:51:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-09-08 12:51:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2054 transitions. [2019-09-08 12:51:02,212 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2054 transitions. Word has length 120 [2019-09-08 12:51:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:02,213 INFO L475 AbstractCegarLoop]: Abstraction has 1574 states and 2054 transitions. [2019-09-08 12:51:02,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:51:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2054 transitions. [2019-09-08 12:51:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:02,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:02,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,215 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1673657433, now seen corresponding path program 1 times [2019-09-08 12:51:02,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:02,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:02,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:03,019 INFO L134 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:51:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:51:03,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:51:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:51:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:51:03,020 INFO L87 Difference]: Start difference. First operand 1574 states and 2054 transitions. Second operand 17 states. [2019-09-08 12:51:03,683 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:51:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:09,869 INFO L93 Difference]: Finished difference Result 3177 states and 4242 transitions. [2019-09-08 12:51:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:51:09,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:51:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:09,873 INFO L225 Difference]: With dead ends: 3177 [2019-09-08 12:51:09,874 INFO L226 Difference]: Without dead ends: 2965 [2019-09-08 12:51:09,875 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:51:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-09-08 12:51:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1554. [2019-09-08 12:51:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-09-08 12:51:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2025 transitions. [2019-09-08 12:51:10,319 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2025 transitions. Word has length 120 [2019-09-08 12:51:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:10,320 INFO L475 AbstractCegarLoop]: Abstraction has 1554 states and 2025 transitions. [2019-09-08 12:51:10,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:51:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2025 transitions. [2019-09-08 12:51:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:10,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:10,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,322 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -885299110, now seen corresponding path program 1 times [2019-09-08 12:51:10,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:10,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:11,742 INFO L134 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:51:11,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:11,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:51:11,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:51:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:51:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:11,744 INFO L87 Difference]: Start difference. First operand 1554 states and 2025 transitions. Second operand 22 states. [2019-09-08 12:51:12,853 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 12:51:13,130 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 12:51:13,451 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-08 12:51:13,621 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:51:14,324 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 12:51:14,910 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:51:15,170 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-08 12:51:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:23,167 INFO L93 Difference]: Finished difference Result 3225 states and 4269 transitions. [2019-09-08 12:51:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:51:23,168 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2019-09-08 12:51:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:23,170 INFO L225 Difference]: With dead ends: 3225 [2019-09-08 12:51:23,170 INFO L226 Difference]: Without dead ends: 3013 [2019-09-08 12:51:23,171 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:51:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2019-09-08 12:51:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 1566. [2019-09-08 12:51:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-09-08 12:51:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2037 transitions. [2019-09-08 12:51:23,638 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2037 transitions. Word has length 120 [2019-09-08 12:51:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:23,638 INFO L475 AbstractCegarLoop]: Abstraction has 1566 states and 2037 transitions. [2019-09-08 12:51:23,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:51:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2037 transitions. [2019-09-08 12:51:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:23,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:23,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:23,640 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash -257998964, now seen corresponding path program 1 times [2019-09-08 12:51:23,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:24,381 INFO L134 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:51:24,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:24,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:51:24,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:51:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:51:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:51:24,382 INFO L87 Difference]: Start difference. First operand 1566 states and 2037 transitions. Second operand 17 states. [2019-09-08 12:51:25,035 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:51:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:31,074 INFO L93 Difference]: Finished difference Result 3129 states and 4171 transitions. [2019-09-08 12:51:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:51:31,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:51:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:31,077 INFO L225 Difference]: With dead ends: 3129 [2019-09-08 12:51:31,077 INFO L226 Difference]: Without dead ends: 2925 [2019-09-08 12:51:31,077 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:51:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-09-08 12:51:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1552. [2019-09-08 12:51:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-09-08 12:51:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2015 transitions. [2019-09-08 12:51:31,534 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2015 transitions. Word has length 120 [2019-09-08 12:51:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:31,535 INFO L475 AbstractCegarLoop]: Abstraction has 1552 states and 2015 transitions. [2019-09-08 12:51:31,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:51:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2015 transitions. [2019-09-08 12:51:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:31,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:31,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:51:31,537 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash 604662434, now seen corresponding path program 1 times [2019-09-08 12:51:31,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:31,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:31,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:31,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:31,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:32,761 INFO L134 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:51:32,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:32,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:51:32,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:51:32,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:51:32,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:32,763 INFO L87 Difference]: Start difference. First operand 1552 states and 2015 transitions. Second operand 21 states. [2019-09-08 12:51:33,785 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-08 12:51:34,058 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 12:51:34,239 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:51:34,415 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:51:34,612 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:51:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:43,133 INFO L93 Difference]: Finished difference Result 2260 states and 2945 transitions. [2019-09-08 12:51:43,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:51:43,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-09-08 12:51:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:43,136 INFO L225 Difference]: With dead ends: 2260 [2019-09-08 12:51:43,136 INFO L226 Difference]: Without dead ends: 2090 [2019-09-08 12:51:43,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:51:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-09-08 12:51:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1575. [2019-09-08 12:51:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2019-09-08 12:51:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2047 transitions. [2019-09-08 12:51:43,611 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2047 transitions. Word has length 120 [2019-09-08 12:51:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:43,612 INFO L475 AbstractCegarLoop]: Abstraction has 1575 states and 2047 transitions. [2019-09-08 12:51:43,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:51:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2047 transitions. [2019-09-08 12:51:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:43,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:43,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,614 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1672958410, now seen corresponding path program 1 times [2019-09-08 12:51:43,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:44,838 INFO L134 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:51:44,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:51:44,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:51:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:51:44,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:44,839 INFO L87 Difference]: Start difference. First operand 1575 states and 2047 transitions. Second operand 22 states. [2019-09-08 12:51:45,910 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:51:46,146 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-08 12:51:46,523 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 12:51:46,668 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 12:51:47,021 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 12:51:47,372 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 12:51:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:53,196 INFO L93 Difference]: Finished difference Result 3370 states and 4449 transitions. [2019-09-08 12:51:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:51:53,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2019-09-08 12:51:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:53,199 INFO L225 Difference]: With dead ends: 3370 [2019-09-08 12:51:53,199 INFO L226 Difference]: Without dead ends: 3088 [2019-09-08 12:51:53,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:51:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-09-08 12:51:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1593. [2019-09-08 12:51:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-09-08 12:51:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2065 transitions. [2019-09-08 12:51:53,724 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2065 transitions. Word has length 120 [2019-09-08 12:51:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:53,724 INFO L475 AbstractCegarLoop]: Abstraction has 1593 states and 2065 transitions. [2019-09-08 12:51:53,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:51:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2065 transitions. [2019-09-08 12:51:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:51:53,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:53,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:53,726 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash 68118332, now seen corresponding path program 1 times [2019-09-08 12:51:53,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:53,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:53,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:53,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:55,009 INFO L134 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:51:55,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:55,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:51:55,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:51:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:51:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:55,010 INFO L87 Difference]: Start difference. First operand 1593 states and 2065 transitions. Second operand 22 states. [2019-09-08 12:51:56,091 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-08 12:51:56,360 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-08 12:51:56,732 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-09-08 12:51:56,935 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:51:57,370 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-08 12:51:57,791 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-08 12:51:58,102 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-08 12:51:58,454 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-08 12:52:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:06,117 INFO L93 Difference]: Finished difference Result 3138 states and 4146 transitions. [2019-09-08 12:52:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:52:06,118 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2019-09-08 12:52:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:06,120 INFO L225 Difference]: With dead ends: 3138 [2019-09-08 12:52:06,120 INFO L226 Difference]: Without dead ends: 2934 [2019-09-08 12:52:06,121 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:52:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-09-08 12:52:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1605. [2019-09-08 12:52:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-08 12:52:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2077 transitions. [2019-09-08 12:52:06,668 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2077 transitions. Word has length 120 [2019-09-08 12:52:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:06,668 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2077 transitions. [2019-09-08 12:52:06,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:52:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2077 transitions. [2019-09-08 12:52:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:06,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:06,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,670 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -546630540, now seen corresponding path program 1 times [2019-09-08 12:52:06,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:06,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:06,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:07,446 INFO L134 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:52:07,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:07,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:52:07,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:52:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:52:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:52:07,447 INFO L87 Difference]: Start difference. First operand 1605 states and 2077 transitions. Second operand 17 states. [2019-09-08 12:52:08,051 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:52:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:13,234 INFO L93 Difference]: Finished difference Result 3090 states and 4111 transitions. [2019-09-08 12:52:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:52:13,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:52:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:13,236 INFO L225 Difference]: With dead ends: 3090 [2019-09-08 12:52:13,236 INFO L226 Difference]: Without dead ends: 2896 [2019-09-08 12:52:13,237 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:52:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2019-09-08 12:52:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1595. [2019-09-08 12:52:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-09-08 12:52:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2059 transitions. [2019-09-08 12:52:13,759 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2059 transitions. Word has length 120 [2019-09-08 12:52:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:13,760 INFO L475 AbstractCegarLoop]: Abstraction has 1595 states and 2059 transitions. [2019-09-08 12:52:13,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:52:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2059 transitions. [2019-09-08 12:52:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:13,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:13,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:13,761 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1254564696, now seen corresponding path program 1 times [2019-09-08 12:52:13,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:13,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:14,867 INFO L134 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:52:14,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:14,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:52:14,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:52:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:52:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:52:14,869 INFO L87 Difference]: Start difference. First operand 1595 states and 2059 transitions. Second operand 16 states. [2019-09-08 12:52:15,641 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 12:52:15,802 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:52:15,953 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:52:16,131 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:52:16,295 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:52:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:23,998 INFO L93 Difference]: Finished difference Result 2696 states and 3410 transitions. [2019-09-08 12:52:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:52:23,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2019-09-08 12:52:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:24,001 INFO L225 Difference]: With dead ends: 2696 [2019-09-08 12:52:24,001 INFO L226 Difference]: Without dead ends: 2692 [2019-09-08 12:52:24,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:52:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2019-09-08 12:52:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 1601. [2019-09-08 12:52:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-09-08 12:52:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2067 transitions. [2019-09-08 12:52:24,557 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2067 transitions. Word has length 120 [2019-09-08 12:52:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:24,557 INFO L475 AbstractCegarLoop]: Abstraction has 1601 states and 2067 transitions. [2019-09-08 12:52:24,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:52:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2067 transitions. [2019-09-08 12:52:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:24,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:24,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:24,559 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash 687790848, now seen corresponding path program 1 times [2019-09-08 12:52:24,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:24,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:24,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:26,060 INFO L134 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:52:26,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:26,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:52:26,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:52:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:52:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:26,061 INFO L87 Difference]: Start difference. First operand 1601 states and 2067 transitions. Second operand 21 states. [2019-09-08 12:52:27,201 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:52:27,545 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-08 12:52:27,743 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:52:27,924 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:52:28,141 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:52:28,343 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:52:30,837 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:52:32,472 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 12:52:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:40,366 INFO L93 Difference]: Finished difference Result 3117 states and 4000 transitions. [2019-09-08 12:52:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:52:40,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-09-08 12:52:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:40,369 INFO L225 Difference]: With dead ends: 3117 [2019-09-08 12:52:40,370 INFO L226 Difference]: Without dead ends: 2944 [2019-09-08 12:52:40,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:52:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-09-08 12:52:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1600. [2019-09-08 12:52:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-09-08 12:52:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2064 transitions. [2019-09-08 12:52:40,993 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2064 transitions. Word has length 120 [2019-09-08 12:52:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:40,994 INFO L475 AbstractCegarLoop]: Abstraction has 1600 states and 2064 transitions. [2019-09-08 12:52:40,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:52:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2064 transitions. [2019-09-08 12:52:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:40,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:40,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:40,995 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -986592702, now seen corresponding path program 1 times [2019-09-08 12:52:40,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:40,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:40,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:41,951 INFO L134 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:52:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:52:41,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:52:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:52:41,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:52:41,952 INFO L87 Difference]: Start difference. First operand 1600 states and 2064 transitions. Second operand 17 states. [2019-09-08 12:52:42,618 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:52:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:48,717 INFO L93 Difference]: Finished difference Result 3084 states and 4092 transitions. [2019-09-08 12:52:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:52:48,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:52:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:48,720 INFO L225 Difference]: With dead ends: 3084 [2019-09-08 12:52:48,720 INFO L226 Difference]: Without dead ends: 2884 [2019-09-08 12:52:48,721 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:52:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2019-09-08 12:52:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1586. [2019-09-08 12:52:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-09-08 12:52:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2042 transitions. [2019-09-08 12:52:49,339 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2042 transitions. Word has length 120 [2019-09-08 12:52:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:49,340 INFO L475 AbstractCegarLoop]: Abstraction has 1586 states and 2042 transitions. [2019-09-08 12:52:49,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:52:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2042 transitions. [2019-09-08 12:52:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:49,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:49,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,341 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash -33278209, now seen corresponding path program 1 times [2019-09-08 12:52:49,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:49,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:49,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:50,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:50,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:52:50,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:52:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:52:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:52:50,174 INFO L87 Difference]: Start difference. First operand 1586 states and 2042 transitions. Second operand 17 states. [2019-09-08 12:52:50,743 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:52:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:52,951 INFO L93 Difference]: Finished difference Result 2417 states and 3190 transitions. [2019-09-08 12:52:52,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:52:52,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:52:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:52,954 INFO L225 Difference]: With dead ends: 2417 [2019-09-08 12:52:52,954 INFO L226 Difference]: Without dead ends: 1876 [2019-09-08 12:52:52,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:52:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-09-08 12:52:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1404. [2019-09-08 12:52:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-09-08 12:52:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1797 transitions. [2019-09-08 12:52:53,553 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1797 transitions. Word has length 120 [2019-09-08 12:52:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:53,553 INFO L475 AbstractCegarLoop]: Abstraction has 1404 states and 1797 transitions. [2019-09-08 12:52:53,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:52:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1797 transitions. [2019-09-08 12:52:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:52:53,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:53,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:53,555 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1171381207, now seen corresponding path program 1 times [2019-09-08 12:52:53,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:53,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:54,857 INFO L134 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:52:54,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:54,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:52:54,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:52:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:52:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:52:54,858 INFO L87 Difference]: Start difference. First operand 1404 states and 1797 transitions. Second operand 22 states. [2019-09-08 12:52:55,918 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-08 12:52:56,180 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:52:56,497 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-08 12:52:56,682 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:52:57,601 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:52:58,341 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:53:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:09,563 INFO L93 Difference]: Finished difference Result 3274 states and 4321 transitions. [2019-09-08 12:53:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:53:09,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2019-09-08 12:53:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:09,568 INFO L225 Difference]: With dead ends: 3274 [2019-09-08 12:53:09,568 INFO L226 Difference]: Without dead ends: 3101 [2019-09-08 12:53:09,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:53:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-09-08 12:53:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 1410. [2019-09-08 12:53:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-09-08 12:53:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1803 transitions. [2019-09-08 12:53:10,139 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1803 transitions. Word has length 120 [2019-09-08 12:53:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:10,139 INFO L475 AbstractCegarLoop]: Abstraction has 1410 states and 1803 transitions. [2019-09-08 12:53:10,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:53:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1803 transitions. [2019-09-08 12:53:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:53:10,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:10,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:10,141 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1314985142, now seen corresponding path program 1 times [2019-09-08 12:53:10,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:10,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:10,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:53:10,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:10,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:53:10,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:53:10,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:53:10,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:53:10,992 INFO L87 Difference]: Start difference. First operand 1410 states and 1803 transitions. Second operand 17 states. [2019-09-08 12:53:11,732 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-08 12:53:11,877 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 12:53:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:19,673 INFO L93 Difference]: Finished difference Result 2654 states and 3519 transitions. [2019-09-08 12:53:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:53:19,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-09-08 12:53:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:19,676 INFO L225 Difference]: With dead ends: 2654 [2019-09-08 12:53:19,676 INFO L226 Difference]: Without dead ends: 2485 [2019-09-08 12:53:19,677 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:53:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-09-08 12:53:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 1410. [2019-09-08 12:53:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-09-08 12:53:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1801 transitions. [2019-09-08 12:53:20,282 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1801 transitions. Word has length 120 [2019-09-08 12:53:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:20,282 INFO L475 AbstractCegarLoop]: Abstraction has 1410 states and 1801 transitions. [2019-09-08 12:53:20,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:53:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1801 transitions. [2019-09-08 12:53:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:53:20,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:20,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] [2019-09-08 12:53:20,284 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1035541978, now seen corresponding path program 1 times [2019-09-08 12:53:20,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:20,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:21,115 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:53:21,283 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 12:53:21,453 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 12:53:21,630 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-08 12:53:21,812 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:53:21,991 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 12:53:23,469 INFO L134 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:53:23,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:23,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-08 12:53:23,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 12:53:23,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 12:53:23,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:53:23,470 INFO L87 Difference]: Start difference. First operand 1410 states and 1801 transitions. Second operand 35 states. [2019-09-08 12:53:23,701 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-09-08 12:53:24,930 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-08 12:53:25,123 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-08 12:53:25,332 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-08 12:53:25,664 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-09-08 12:53:26,279 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-09-08 12:53:26,718 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2019-09-08 12:53:27,224 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 97 [2019-09-08 12:53:27,810 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 110 [2019-09-08 12:53:28,481 WARN L188 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 122 [2019-09-08 12:53:28,796 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2019-09-08 12:53:29,113 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 87 [2019-09-08 12:53:29,443 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2019-09-08 12:53:29,757 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-09-08 12:53:30,064 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-09-08 12:53:30,539 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76