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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:17:55,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:17:55,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:17:55,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:17:55,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:17:55,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:17:55,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:17:55,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:17:55,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:17:55,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:17:55,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:17:55,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:17:55,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:17:55,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:17:55,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:17:55,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:17:55,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:17:55,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:17:55,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:17:55,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:17:55,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:17:55,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:17:55,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:17:55,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:17:55,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:17:55,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:17:55,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:17:55,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:17:55,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:17:55,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:17:55,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:17:55,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:17:55,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:17:55,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:17:55,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:17:55,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:17:55,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:17:55,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:17:55,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:17:55,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:17:55,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:17:55,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:17:55,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:17:55,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:17:55,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:17:55,369 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:17:55,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:17:55,370 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:17:55,370 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:17:55,370 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:17:55,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:17:55,371 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:17:55,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:17:55,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:17:55,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:17:55,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:17:55,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:17:55,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:17:55,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:17:55,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:17:55,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:17:55,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:17:55,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:17:55,373 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:17:55,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:17:55,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:17:55,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:17:55,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:17:55,374 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:17:55,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:17:55,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:17:55,375 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:17:55,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:17:55,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:17:55,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:17:55,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:17:55,421 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:17:55,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:17:55,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebcb616d/b5620bfb0da84269ab974200bfa4e701/FLAG1e44d13a3 [2019-09-10 06:17:56,106 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:17:56,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:17:56,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebcb616d/b5620bfb0da84269ab974200bfa4e701/FLAG1e44d13a3 [2019-09-10 06:17:56,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebcb616d/b5620bfb0da84269ab974200bfa4e701 [2019-09-10 06:17:56,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:17:56,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:17:56,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:17:56,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:17:56,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:17:56,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:17:56" (1/1) ... [2019-09-10 06:17:56,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:56, skipping insertion in model container [2019-09-10 06:17:56,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:17:56" (1/1) ... [2019-09-10 06:17:56,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:17:56,442 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:17:57,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:17:57,379 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:17:57,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:17:57,754 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:17:57,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57 WrapperNode [2019-09-10 06:17:57,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:17:57,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:17:57,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:17:57,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:17:57,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... [2019-09-10 06:17:57,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:17:57,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:17:57,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:17:57,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:17:57,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:17:58,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:17:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:17:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:17:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:17:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:17:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:17:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:17:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:17:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:17:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:17:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:17:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:17:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:17:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:17:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:17:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:17:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:17:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:17:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:18:00,429 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:18:00,429 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:18:00,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:00 BoogieIcfgContainer [2019-09-10 06:18:00,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:18:00,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:18:00,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:18:00,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:18:00,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:17:56" (1/3) ... [2019-09-10 06:18:00,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecac5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:00, skipping insertion in model container [2019-09-10 06:18:00,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:17:57" (2/3) ... [2019-09-10 06:18:00,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecac5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:00, skipping insertion in model container [2019-09-10 06:18:00,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:00" (3/3) ... [2019-09-10 06:18:00,439 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:18:00,449 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:18:00,458 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:18:00,475 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:18:00,498 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:18:00,498 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:18:00,498 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:18:00,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:18:00,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:18:00,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:18:00,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:18:00,499 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:18:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2019-09-10 06:18:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 06:18:00,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:00,561 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1597217065, now seen corresponding path program 1 times [2019-09-10 06:18:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:00,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:02,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:02,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:02,214 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 4 states. [2019-09-10 06:18:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:02,570 INFO L93 Difference]: Finished difference Result 1207 states and 2149 transitions. [2019-09-10 06:18:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:02,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-09-10 06:18:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:02,596 INFO L225 Difference]: With dead ends: 1207 [2019-09-10 06:18:02,597 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 06:18:02,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 06:18:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1166. [2019-09-10 06:18:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-09-10 06:18:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1816 transitions. [2019-09-10 06:18:02,735 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1816 transitions. Word has length 235 [2019-09-10 06:18:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:02,737 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1816 transitions. [2019-09-10 06:18:02,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1816 transitions. [2019-09-10 06:18:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:18:02,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:02,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:02,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1613581353, now seen corresponding path program 1 times [2019-09-10 06:18:02,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:02,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:03,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:03,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:03,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,102 INFO L87 Difference]: Start difference. First operand 1166 states and 1816 transitions. Second operand 3 states. [2019-09-10 06:18:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:03,207 INFO L93 Difference]: Finished difference Result 2287 states and 3543 transitions. [2019-09-10 06:18:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:03,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-10 06:18:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:03,222 INFO L225 Difference]: With dead ends: 2287 [2019-09-10 06:18:03,222 INFO L226 Difference]: Without dead ends: 2287 [2019-09-10 06:18:03,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2019-09-10 06:18:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2256. [2019-09-10 06:18:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2019-09-10 06:18:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3500 transitions. [2019-09-10 06:18:03,288 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3500 transitions. Word has length 237 [2019-09-10 06:18:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:03,289 INFO L475 AbstractCegarLoop]: Abstraction has 2256 states and 3500 transitions. [2019-09-10 06:18:03,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3500 transitions. [2019-09-10 06:18:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:18:03,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:03,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:03,298 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1404773198, now seen corresponding path program 1 times [2019-09-10 06:18:03,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:03,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:03,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,503 INFO L87 Difference]: Start difference. First operand 2256 states and 3500 transitions. Second operand 3 states. [2019-09-10 06:18:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:03,575 INFO L93 Difference]: Finished difference Result 4479 states and 6940 transitions. [2019-09-10 06:18:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:03,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-10 06:18:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:03,598 INFO L225 Difference]: With dead ends: 4479 [2019-09-10 06:18:03,598 INFO L226 Difference]: Without dead ends: 4479 [2019-09-10 06:18:03,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2019-09-10 06:18:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 2275. [2019-09-10 06:18:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-09-10 06:18:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3528 transitions. [2019-09-10 06:18:03,669 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3528 transitions. Word has length 237 [2019-09-10 06:18:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:03,669 INFO L475 AbstractCegarLoop]: Abstraction has 2275 states and 3528 transitions. [2019-09-10 06:18:03,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3528 transitions. [2019-09-10 06:18:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:18:03,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:03,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:03,677 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1129052347, now seen corresponding path program 1 times [2019-09-10 06:18:03,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:03,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:03,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:03,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:03,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,796 INFO L87 Difference]: Start difference. First operand 2275 states and 3528 transitions. Second operand 3 states. [2019-09-10 06:18:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:03,868 INFO L93 Difference]: Finished difference Result 4497 states and 6961 transitions. [2019-09-10 06:18:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:03,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 06:18:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:03,896 INFO L225 Difference]: With dead ends: 4497 [2019-09-10 06:18:03,896 INFO L226 Difference]: Without dead ends: 4497 [2019-09-10 06:18:03,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2019-09-10 06:18:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 2293. [2019-09-10 06:18:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-10 06:18:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3549 transitions. [2019-09-10 06:18:04,043 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3549 transitions. Word has length 238 [2019-09-10 06:18:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:04,044 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3549 transitions. [2019-09-10 06:18:04,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3549 transitions. [2019-09-10 06:18:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 06:18:04,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:04,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:04,055 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1019398943, now seen corresponding path program 1 times [2019-09-10 06:18:04,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:04,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:04,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:04,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:04,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:04,460 INFO L87 Difference]: Start difference. First operand 2293 states and 3549 transitions. Second operand 4 states. [2019-09-10 06:18:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:04,562 INFO L93 Difference]: Finished difference Result 4424 states and 6810 transitions. [2019-09-10 06:18:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:04,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 06:18:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:04,587 INFO L225 Difference]: With dead ends: 4424 [2019-09-10 06:18:04,588 INFO L226 Difference]: Without dead ends: 4424 [2019-09-10 06:18:04,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-09-10 06:18:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 2500. [2019-09-10 06:18:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-09-10 06:18:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3902 transitions. [2019-09-10 06:18:04,674 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3902 transitions. Word has length 239 [2019-09-10 06:18:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:04,675 INFO L475 AbstractCegarLoop]: Abstraction has 2500 states and 3902 transitions. [2019-09-10 06:18:04,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3902 transitions. [2019-09-10 06:18:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 06:18:04,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:04,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:04,687 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 655104156, now seen corresponding path program 1 times [2019-09-10 06:18:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:05,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-10 06:18:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:05,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:05,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:05,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:05,058 INFO L87 Difference]: Start difference. First operand 2500 states and 3902 transitions. Second operand 3 states. [2019-09-10 06:18:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:05,230 INFO L93 Difference]: Finished difference Result 4642 states and 7156 transitions. [2019-09-10 06:18:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:05,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 06:18:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:05,261 INFO L225 Difference]: With dead ends: 4642 [2019-09-10 06:18:05,262 INFO L226 Difference]: Without dead ends: 4642 [2019-09-10 06:18:05,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2019-09-10 06:18:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 4613. [2019-09-10 06:18:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4613 states. [2019-09-10 06:18:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 7117 transitions. [2019-09-10 06:18:05,405 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 7117 transitions. Word has length 239 [2019-09-10 06:18:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:05,406 INFO L475 AbstractCegarLoop]: Abstraction has 4613 states and 7117 transitions. [2019-09-10 06:18:05,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 7117 transitions. [2019-09-10 06:18:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 06:18:05,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:05,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:05,425 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash -134121780, now seen corresponding path program 1 times [2019-09-10 06:18:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:05,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:05,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:05,590 INFO L87 Difference]: Start difference. First operand 4613 states and 7117 transitions. Second operand 3 states. [2019-09-10 06:18:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:05,662 INFO L93 Difference]: Finished difference Result 8459 states and 12878 transitions. [2019-09-10 06:18:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:05,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 06:18:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:05,714 INFO L225 Difference]: With dead ends: 8459 [2019-09-10 06:18:05,714 INFO L226 Difference]: Without dead ends: 8459 [2019-09-10 06:18:05,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2019-09-10 06:18:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 4717. [2019-09-10 06:18:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2019-09-10 06:18:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 7260 transitions. [2019-09-10 06:18:05,941 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 7260 transitions. Word has length 241 [2019-09-10 06:18:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:05,942 INFO L475 AbstractCegarLoop]: Abstraction has 4717 states and 7260 transitions. [2019-09-10 06:18:05,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 7260 transitions. [2019-09-10 06:18:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 06:18:05,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:05,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:05,954 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -98518151, now seen corresponding path program 1 times [2019-09-10 06:18:05,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:06,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:06,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:06,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:06,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,104 INFO L87 Difference]: Start difference. First operand 4717 states and 7260 transitions. Second operand 3 states. [2019-09-10 06:18:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:06,177 INFO L93 Difference]: Finished difference Result 8584 states and 13024 transitions. [2019-09-10 06:18:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:06,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-10 06:18:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:06,200 INFO L225 Difference]: With dead ends: 8584 [2019-09-10 06:18:06,200 INFO L226 Difference]: Without dead ends: 8584 [2019-09-10 06:18:06,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8584 states. [2019-09-10 06:18:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8584 to 4842. [2019-09-10 06:18:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4842 states. [2019-09-10 06:18:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 7406 transitions. [2019-09-10 06:18:06,323 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 7406 transitions. Word has length 242 [2019-09-10 06:18:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 4842 states and 7406 transitions. [2019-09-10 06:18:06,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 7406 transitions. [2019-09-10 06:18:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 06:18:06,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:06,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:06,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1709942343, now seen corresponding path program 1 times [2019-09-10 06:18:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:06,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:06,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:06,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:06,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:06,696 INFO L87 Difference]: Start difference. First operand 4842 states and 7406 transitions. Second operand 5 states. [2019-09-10 06:18:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:07,668 INFO L93 Difference]: Finished difference Result 6820 states and 10427 transitions. [2019-09-10 06:18:07,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:07,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-09-10 06:18:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:07,686 INFO L225 Difference]: With dead ends: 6820 [2019-09-10 06:18:07,686 INFO L226 Difference]: Without dead ends: 6820 [2019-09-10 06:18:07,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:18:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2019-09-10 06:18:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 6818. [2019-09-10 06:18:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6818 states. [2019-09-10 06:18:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6818 states to 6818 states and 10426 transitions. [2019-09-10 06:18:07,820 INFO L78 Accepts]: Start accepts. Automaton has 6818 states and 10426 transitions. Word has length 243 [2019-09-10 06:18:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:07,821 INFO L475 AbstractCegarLoop]: Abstraction has 6818 states and 10426 transitions. [2019-09-10 06:18:07,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states and 10426 transitions. [2019-09-10 06:18:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 06:18:07,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:07,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:07,837 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1091040623, now seen corresponding path program 1 times [2019-09-10 06:18:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:09,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-10 06:18:09,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:09,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:18:09,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:09,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:18:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:18:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:18:09,051 INFO L87 Difference]: Start difference. First operand 6818 states and 10426 transitions. Second operand 17 states. [2019-09-10 06:18:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:11,501 INFO L93 Difference]: Finished difference Result 11194 states and 16975 transitions. [2019-09-10 06:18:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:18:11,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 243 [2019-09-10 06:18:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:11,529 INFO L225 Difference]: With dead ends: 11194 [2019-09-10 06:18:11,530 INFO L226 Difference]: Without dead ends: 11194 [2019-09-10 06:18:11,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:18:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-09-10 06:18:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 7698. [2019-09-10 06:18:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7698 states. [2019-09-10 06:18:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7698 states to 7698 states and 11662 transitions. [2019-09-10 06:18:11,729 INFO L78 Accepts]: Start accepts. Automaton has 7698 states and 11662 transitions. Word has length 243 [2019-09-10 06:18:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:11,730 INFO L475 AbstractCegarLoop]: Abstraction has 7698 states and 11662 transitions. [2019-09-10 06:18:11,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:18:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7698 states and 11662 transitions. [2019-09-10 06:18:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 06:18:11,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:11,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:11,749 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2061385505, now seen corresponding path program 1 times [2019-09-10 06:18:11,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:11,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:12,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:12,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:12,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:12,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:12,350 INFO L87 Difference]: Start difference. First operand 7698 states and 11662 transitions. Second operand 4 states. [2019-09-10 06:18:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:12,526 INFO L93 Difference]: Finished difference Result 14840 states and 22308 transitions. [2019-09-10 06:18:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:12,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-09-10 06:18:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:12,570 INFO L225 Difference]: With dead ends: 14840 [2019-09-10 06:18:12,570 INFO L226 Difference]: Without dead ends: 14840 [2019-09-10 06:18:12,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14840 states. [2019-09-10 06:18:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14840 to 14815. [2019-09-10 06:18:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14815 states. [2019-09-10 06:18:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14815 states to 14815 states and 22275 transitions. [2019-09-10 06:18:12,804 INFO L78 Accepts]: Start accepts. Automaton has 14815 states and 22275 transitions. Word has length 243 [2019-09-10 06:18:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:12,804 INFO L475 AbstractCegarLoop]: Abstraction has 14815 states and 22275 transitions. [2019-09-10 06:18:12,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14815 states and 22275 transitions. [2019-09-10 06:18:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:18:12,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:12,832 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1532797198, now seen corresponding path program 1 times [2019-09-10 06:18:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:12,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:13,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:13,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:13,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:13,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:13,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:13,061 INFO L87 Difference]: Start difference. First operand 14815 states and 22275 transitions. Second operand 3 states. [2019-09-10 06:18:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:13,319 INFO L93 Difference]: Finished difference Result 28586 states and 42563 transitions. [2019-09-10 06:18:13,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:13,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 06:18:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:13,381 INFO L225 Difference]: With dead ends: 28586 [2019-09-10 06:18:13,382 INFO L226 Difference]: Without dead ends: 28586 [2019-09-10 06:18:13,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28586 states. [2019-09-10 06:18:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28586 to 28563. [2019-09-10 06:18:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28563 states. [2019-09-10 06:18:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28563 states to 28563 states and 42534 transitions. [2019-09-10 06:18:13,797 INFO L78 Accepts]: Start accepts. Automaton has 28563 states and 42534 transitions. Word has length 245 [2019-09-10 06:18:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:13,797 INFO L475 AbstractCegarLoop]: Abstraction has 28563 states and 42534 transitions. [2019-09-10 06:18:13,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28563 states and 42534 transitions. [2019-09-10 06:18:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:18:13,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:13,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:13,848 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1332769017, now seen corresponding path program 1 times [2019-09-10 06:18:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:13,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:14,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:14,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:14,079 INFO L87 Difference]: Start difference. First operand 28563 states and 42534 transitions. Second operand 4 states. [2019-09-10 06:18:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:14,263 INFO L93 Difference]: Finished difference Result 56549 states and 84060 transitions. [2019-09-10 06:18:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:14,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-10 06:18:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:14,402 INFO L225 Difference]: With dead ends: 56549 [2019-09-10 06:18:14,403 INFO L226 Difference]: Without dead ends: 56549 [2019-09-10 06:18:14,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56549 states. [2019-09-10 06:18:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56549 to 30243. [2019-09-10 06:18:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30243 states. [2019-09-10 06:18:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30243 states to 30243 states and 45304 transitions. [2019-09-10 06:18:16,019 INFO L78 Accepts]: Start accepts. Automaton has 30243 states and 45304 transitions. Word has length 245 [2019-09-10 06:18:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:16,019 INFO L475 AbstractCegarLoop]: Abstraction has 30243 states and 45304 transitions. [2019-09-10 06:18:16,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30243 states and 45304 transitions. [2019-09-10 06:18:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:18:16,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:16,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:16,050 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1584462879, now seen corresponding path program 1 times [2019-09-10 06:18:16,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:16,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:16,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:16,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:16,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:16,284 INFO L87 Difference]: Start difference. First operand 30243 states and 45304 transitions. Second operand 3 states. [2019-09-10 06:18:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:16,556 INFO L93 Difference]: Finished difference Result 58845 states and 87460 transitions. [2019-09-10 06:18:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:16,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 06:18:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:16,753 INFO L225 Difference]: With dead ends: 58845 [2019-09-10 06:18:16,754 INFO L226 Difference]: Without dead ends: 58845 [2019-09-10 06:18:16,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58845 states. [2019-09-10 06:18:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58845 to 58824. [2019-09-10 06:18:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58824 states. [2019-09-10 06:18:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58824 states to 58824 states and 87435 transitions. [2019-09-10 06:18:17,964 INFO L78 Accepts]: Start accepts. Automaton has 58824 states and 87435 transitions. Word has length 245 [2019-09-10 06:18:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:17,964 INFO L475 AbstractCegarLoop]: Abstraction has 58824 states and 87435 transitions. [2019-09-10 06:18:17,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58824 states and 87435 transitions. [2019-09-10 06:18:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:18:18,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:18,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:18,022 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -515565086, now seen corresponding path program 1 times [2019-09-10 06:18:18,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:18,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:18,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:18,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:18,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:18,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:18,261 INFO L87 Difference]: Start difference. First operand 58824 states and 87435 transitions. Second operand 4 states. [2019-09-10 06:18:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:18,436 INFO L93 Difference]: Finished difference Result 59296 states and 88337 transitions. [2019-09-10 06:18:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:18,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-10 06:18:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:18,564 INFO L225 Difference]: With dead ends: 59296 [2019-09-10 06:18:18,565 INFO L226 Difference]: Without dead ends: 52816 [2019-09-10 06:18:18,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52816 states. [2019-09-10 06:18:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52816 to 52356. [2019-09-10 06:18:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52356 states. [2019-09-10 06:18:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52356 states to 52356 states and 77765 transitions. [2019-09-10 06:18:20,627 INFO L78 Accepts]: Start accepts. Automaton has 52356 states and 77765 transitions. Word has length 245 [2019-09-10 06:18:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:20,627 INFO L475 AbstractCegarLoop]: Abstraction has 52356 states and 77765 transitions. [2019-09-10 06:18:20,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 52356 states and 77765 transitions. [2019-09-10 06:18:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 06:18:20,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:20,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:20,683 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1615424582, now seen corresponding path program 1 times [2019-09-10 06:18:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:20,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:20,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:20,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:20,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:20,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:20,930 INFO L87 Difference]: Start difference. First operand 52356 states and 77765 transitions. Second operand 4 states. [2019-09-10 06:18:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:21,186 INFO L93 Difference]: Finished difference Result 86887 states and 128077 transitions. [2019-09-10 06:18:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:21,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-10 06:18:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:21,365 INFO L225 Difference]: With dead ends: 86887 [2019-09-10 06:18:21,366 INFO L226 Difference]: Without dead ends: 86360 [2019-09-10 06:18:21,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86360 states. [2019-09-10 06:18:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86360 to 51678. [2019-09-10 06:18:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51678 states. [2019-09-10 06:18:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51678 states to 51678 states and 76762 transitions. [2019-09-10 06:18:22,401 INFO L78 Accepts]: Start accepts. Automaton has 51678 states and 76762 transitions. Word has length 247 [2019-09-10 06:18:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:22,401 INFO L475 AbstractCegarLoop]: Abstraction has 51678 states and 76762 transitions. [2019-09-10 06:18:22,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 51678 states and 76762 transitions. [2019-09-10 06:18:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 06:18:22,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:22,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:22,458 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2065076026, now seen corresponding path program 1 times [2019-09-10 06:18:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:22,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:22,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:22,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:22,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:22,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-10 06:18:22,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:22,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:22,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:22,580 INFO L87 Difference]: Start difference. First operand 51678 states and 76762 transitions. Second operand 3 states. [2019-09-10 06:18:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:22,829 INFO L93 Difference]: Finished difference Result 86844 states and 128026 transitions. [2019-09-10 06:18:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:22,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-09-10 06:18:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:22,940 INFO L225 Difference]: With dead ends: 86844 [2019-09-10 06:18:22,940 INFO L226 Difference]: Without dead ends: 86844 [2019-09-10 06:18:22,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86844 states. [2019-09-10 06:18:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86844 to 52329. [2019-09-10 06:18:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52329 states. [2019-09-10 06:18:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52329 states to 52329 states and 77526 transitions. [2019-09-10 06:18:25,219 INFO L78 Accepts]: Start accepts. Automaton has 52329 states and 77526 transitions. Word has length 250 [2019-09-10 06:18:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:25,219 INFO L475 AbstractCegarLoop]: Abstraction has 52329 states and 77526 transitions. [2019-09-10 06:18:25,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 52329 states and 77526 transitions. [2019-09-10 06:18:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 06:18:25,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:25,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:25,258 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 330031223, now seen corresponding path program 1 times [2019-09-10 06:18:25,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:25,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:25,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:25,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:25,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:25,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:25,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:25,513 INFO L87 Difference]: Start difference. First operand 52329 states and 77526 transitions. Second operand 4 states. [2019-09-10 06:18:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:25,670 INFO L93 Difference]: Finished difference Result 51433 states and 76423 transitions. [2019-09-10 06:18:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:25,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-10 06:18:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:25,728 INFO L225 Difference]: With dead ends: 51433 [2019-09-10 06:18:25,728 INFO L226 Difference]: Without dead ends: 47163 [2019-09-10 06:18:25,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47163 states. [2019-09-10 06:18:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47163 to 46688. [2019-09-10 06:18:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46688 states. [2019-09-10 06:18:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46688 states to 46688 states and 69232 transitions. [2019-09-10 06:18:26,151 INFO L78 Accepts]: Start accepts. Automaton has 46688 states and 69232 transitions. Word has length 251 [2019-09-10 06:18:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:26,151 INFO L475 AbstractCegarLoop]: Abstraction has 46688 states and 69232 transitions. [2019-09-10 06:18:26,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 46688 states and 69232 transitions. [2019-09-10 06:18:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 06:18:26,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:26,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:26,184 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1968231149, now seen corresponding path program 1 times [2019-09-10 06:18:26,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:26,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:26,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:26,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:26,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:26,625 INFO L87 Difference]: Start difference. First operand 46688 states and 69232 transitions. Second operand 4 states. [2019-09-10 06:18:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:27,173 INFO L93 Difference]: Finished difference Result 82869 states and 121466 transitions. [2019-09-10 06:18:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:27,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-10 06:18:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:27,252 INFO L225 Difference]: With dead ends: 82869 [2019-09-10 06:18:27,252 INFO L226 Difference]: Without dead ends: 82869 [2019-09-10 06:18:27,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82869 states. [2019-09-10 06:18:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82869 to 82852. [2019-09-10 06:18:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82852 states. [2019-09-10 06:18:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82852 states to 82852 states and 121447 transitions. [2019-09-10 06:18:27,985 INFO L78 Accepts]: Start accepts. Automaton has 82852 states and 121447 transitions. Word has length 251 [2019-09-10 06:18:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:27,985 INFO L475 AbstractCegarLoop]: Abstraction has 82852 states and 121447 transitions. [2019-09-10 06:18:27,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 82852 states and 121447 transitions. [2019-09-10 06:18:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 06:18:28,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:28,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:28,043 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 395400033, now seen corresponding path program 1 times [2019-09-10 06:18:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:28,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:28,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:28,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:28,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:28,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:28,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:28,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:28,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:28,228 INFO L87 Difference]: Start difference. First operand 82852 states and 121447 transitions. Second operand 3 states. [2019-09-10 06:18:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:29,309 INFO L93 Difference]: Finished difference Result 156143 states and 226474 transitions. [2019-09-10 06:18:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:29,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 06:18:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:29,509 INFO L225 Difference]: With dead ends: 156143 [2019-09-10 06:18:29,509 INFO L226 Difference]: Without dead ends: 156143 [2019-09-10 06:18:29,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156143 states. [2019-09-10 06:18:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156143 to 155796. [2019-09-10 06:18:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155796 states. [2019-09-10 06:18:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155796 states to 155796 states and 226064 transitions. [2019-09-10 06:18:34,296 INFO L78 Accepts]: Start accepts. Automaton has 155796 states and 226064 transitions. Word has length 253 [2019-09-10 06:18:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:34,297 INFO L475 AbstractCegarLoop]: Abstraction has 155796 states and 226064 transitions. [2019-09-10 06:18:34,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 155796 states and 226064 transitions. [2019-09-10 06:18:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 06:18:34,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:34,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:34,430 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2007197606, now seen corresponding path program 1 times [2019-09-10 06:18:34,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:34,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-10 06:18:34,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:34,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:34,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:34,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:34,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:34,685 INFO L87 Difference]: Start difference. First operand 155796 states and 226064 transitions. Second operand 3 states. [2019-09-10 06:18:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:35,524 INFO L93 Difference]: Finished difference Result 296056 states and 425697 transitions. [2019-09-10 06:18:35,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:35,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-10 06:18:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:35,873 INFO L225 Difference]: With dead ends: 296056 [2019-09-10 06:18:35,873 INFO L226 Difference]: Without dead ends: 296056 [2019-09-10 06:18:35,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296056 states. [2019-09-10 06:18:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296056 to 296043. [2019-09-10 06:18:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296043 states. [2019-09-10 06:18:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296043 states to 296043 states and 425686 transitions. [2019-09-10 06:18:43,735 INFO L78 Accepts]: Start accepts. Automaton has 296043 states and 425686 transitions. Word has length 255 [2019-09-10 06:18:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:43,736 INFO L475 AbstractCegarLoop]: Abstraction has 296043 states and 425686 transitions. [2019-09-10 06:18:43,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 296043 states and 425686 transitions. [2019-09-10 06:18:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:18:43,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:43,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:43,985 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2079589877, now seen corresponding path program 1 times [2019-09-10 06:18:43,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:43,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:44,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:44,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:44,111 INFO L87 Difference]: Start difference. First operand 296043 states and 425686 transitions. Second operand 3 states. [2019-09-10 06:18:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:45,116 INFO L93 Difference]: Finished difference Result 494043 states and 706464 transitions. [2019-09-10 06:18:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:45,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-10 06:18:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:45,716 INFO L225 Difference]: With dead ends: 494043 [2019-09-10 06:18:45,717 INFO L226 Difference]: Without dead ends: 494043 [2019-09-10 06:18:45,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494043 states. [2019-09-10 06:18:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494043 to 295503. [2019-09-10 06:18:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295503 states. [2019-09-10 06:18:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295503 states to 295503 states and 424088 transitions. [2019-09-10 06:18:55,012 INFO L78 Accepts]: Start accepts. Automaton has 295503 states and 424088 transitions. Word has length 258 [2019-09-10 06:18:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:55,012 INFO L475 AbstractCegarLoop]: Abstraction has 295503 states and 424088 transitions. [2019-09-10 06:18:55,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 295503 states and 424088 transitions. [2019-09-10 06:18:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 06:18:55,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:55,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:55,257 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash -833471595, now seen corresponding path program 1 times [2019-09-10 06:18:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:55,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:55,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:55,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:55,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:55,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:55,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:55,709 INFO L87 Difference]: Start difference. First operand 295503 states and 424088 transitions. Second operand 4 states. [2019-09-10 06:18:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:58,107 INFO L93 Difference]: Finished difference Result 572900 states and 812896 transitions. [2019-09-10 06:18:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:58,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-10 06:18:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:58,828 INFO L225 Difference]: With dead ends: 572900 [2019-09-10 06:18:58,828 INFO L226 Difference]: Without dead ends: 572900 [2019-09-10 06:18:58,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572900 states. [2019-09-10 06:19:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572900 to 569458. [2019-09-10 06:19:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569458 states. [2019-09-10 06:19:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569458 states to 569458 states and 808680 transitions. [2019-09-10 06:19:11,967 INFO L78 Accepts]: Start accepts. Automaton has 569458 states and 808680 transitions. Word has length 259 [2019-09-10 06:19:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:11,967 INFO L475 AbstractCegarLoop]: Abstraction has 569458 states and 808680 transitions. [2019-09-10 06:19:11,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 569458 states and 808680 transitions. [2019-09-10 06:19:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 06:19:12,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:12,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:12,449 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 74483756, now seen corresponding path program 1 times [2019-09-10 06:19:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:12,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:12,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:12,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:12,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:12,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:12,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:12,656 INFO L87 Difference]: Start difference. First operand 569458 states and 808680 transitions. Second operand 3 states. [2019-09-10 06:19:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:21,935 INFO L93 Difference]: Finished difference Result 1115690 states and 1568197 transitions. [2019-09-10 06:19:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:21,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-10 06:19:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:23,532 INFO L225 Difference]: With dead ends: 1115690 [2019-09-10 06:19:23,532 INFO L226 Difference]: Without dead ends: 1115690 [2019-09-10 06:19:23,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115690 states. [2019-09-10 06:19:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115690 to 1112248. [2019-09-10 06:19:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112248 states. [2019-09-10 06:20:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112248 states to 1112248 states and 1563981 transitions. [2019-09-10 06:20:13,051 INFO L78 Accepts]: Start accepts. Automaton has 1112248 states and 1563981 transitions. Word has length 261 [2019-09-10 06:20:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:13,051 INFO L475 AbstractCegarLoop]: Abstraction has 1112248 states and 1563981 transitions. [2019-09-10 06:20:13,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1112248 states and 1563981 transitions. [2019-09-10 06:20:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 06:20:14,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:14,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:14,112 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 678056007, now seen corresponding path program 1 times [2019-09-10 06:20:14,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:14,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:14,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:14,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:14,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:14,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:14,228 INFO L87 Difference]: Start difference. First operand 1112248 states and 1563981 transitions. Second operand 3 states. [2019-09-10 06:20:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:33,576 INFO L93 Difference]: Finished difference Result 2132273 states and 2990333 transitions. [2019-09-10 06:20:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:33,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-10 06:20:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:37,825 INFO L225 Difference]: With dead ends: 2132273 [2019-09-10 06:20:37,826 INFO L226 Difference]: Without dead ends: 2132273 [2019-09-10 06:20:37,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132273 states. [2019-09-10 06:21:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132273 to 1096920. [2019-09-10 06:21:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096920 states. [2019-09-10 06:21:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096920 states to 1096920 states and 1540919 transitions. [2019-09-10 06:21:33,170 INFO L78 Accepts]: Start accepts. Automaton has 1096920 states and 1540919 transitions. Word has length 261 [2019-09-10 06:21:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:33,170 INFO L475 AbstractCegarLoop]: Abstraction has 1096920 states and 1540919 transitions. [2019-09-10 06:21:33,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1096920 states and 1540919 transitions. [2019-09-10 06:21:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:21:34,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:34,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:34,312 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash 26510244, now seen corresponding path program 1 times [2019-09-10 06:21:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:34,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:34,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:34,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:34,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:34,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:34,426 INFO L87 Difference]: Start difference. First operand 1096920 states and 1540919 transitions. Second operand 3 states. [2019-09-10 06:21:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:48,082 INFO L93 Difference]: Finished difference Result 2158557 states and 3029946 transitions. [2019-09-10 06:21:48,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:48,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 06:21:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:53,877 INFO L225 Difference]: With dead ends: 2158557 [2019-09-10 06:21:53,878 INFO L226 Difference]: Without dead ends: 2158557 [2019-09-10 06:21:53,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158557 states. [2019-09-10 06:22:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158557 to 1097575. [2019-09-10 06:22:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097575 states. [2019-09-10 06:22:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097575 states to 1097575 states and 1541668 transitions. [2019-09-10 06:22:49,782 INFO L78 Accepts]: Start accepts. Automaton has 1097575 states and 1541668 transitions. Word has length 262 [2019-09-10 06:22:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:49,782 INFO L475 AbstractCegarLoop]: Abstraction has 1097575 states and 1541668 transitions. [2019-09-10 06:22:49,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1097575 states and 1541668 transitions.