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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:14:45,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:14:45,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:14:45,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:14:45,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:14:45,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:14:45,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:14:45,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:14:45,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:14:45,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:14:45,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:14:45,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:14:45,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:14:45,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:14:45,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:14:45,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:14:45,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:14:45,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:14:45,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:14:45,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:14:45,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:14:45,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:14:45,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:14:45,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:14:45,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:14:45,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:14:45,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:14:45,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:14:45,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:14:45,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:14:45,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:14:45,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:14:45,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:14:45,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:14:45,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:14:45,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:14:45,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:14:45,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:14:45,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:14:45,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:14:45,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:14:45,900 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:14:45,915 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:14:45,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:14:45,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:14:45,916 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:14:45,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:14:45,917 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:14:45,917 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:14:45,917 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:14:45,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:14:45,917 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:14:45,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:14:45,918 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:14:45,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:14:45,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:14:45,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:14:45,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:14:45,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:14:45,920 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:14:45,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:14:45,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:14:45,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:14:45,920 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:14:45,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:14:45,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:14:45,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:14:45,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:14:45,921 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:14:45,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:14:45,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:14:45,922 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:14:45,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:14:45,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:14:45,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:14:45,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:14:45,966 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:14:45,967 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:14:46,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca06aaae/e2bedeb7d44e494887986842a466543a/FLAG2b35b3ca0 [2019-09-10 06:14:46,724 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:14:46,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:14:46,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca06aaae/e2bedeb7d44e494887986842a466543a/FLAG2b35b3ca0 [2019-09-10 06:14:46,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca06aaae/e2bedeb7d44e494887986842a466543a [2019-09-10 06:14:46,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:14:46,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:14:46,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:14:46,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:14:46,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:14:46,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:14:46" (1/1) ... [2019-09-10 06:14:46,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279c3eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:46, skipping insertion in model container [2019-09-10 06:14:46,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:14:46" (1/1) ... [2019-09-10 06:14:46,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:14:47,105 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:14:48,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:14:48,417 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:14:49,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:14:49,347 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:14:49,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49 WrapperNode [2019-09-10 06:14:49,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:14:49,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:14:49,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:14:49,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:14:49,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (1/1) ... [2019-09-10 06:14:49,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:14:49,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:14:49,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:14:49,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:14:49,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (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:14:49,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:14:49,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:14:49,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:14:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:14:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:14:49,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:14:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:14:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:14:49,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:14:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:14:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:14:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:14:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:14:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:14:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:14:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:14:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:14:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:14:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:14:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:14:53,019 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:14:53,020 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:14:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:14:53 BoogieIcfgContainer [2019-09-10 06:14:53,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:14:53,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:14:53,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:14:53,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:14:53,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:14:46" (1/3) ... [2019-09-10 06:14:53,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60503441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:14:53, skipping insertion in model container [2019-09-10 06:14:53,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:14:49" (2/3) ... [2019-09-10 06:14:53,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60503441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:14:53, skipping insertion in model container [2019-09-10 06:14:53,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:14:53" (3/3) ... [2019-09-10 06:14:53,035 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:14:53,043 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:14:53,052 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:14:53,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:14:53,097 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:14:53,097 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:14:53,097 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:14:53,097 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:14:53,097 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:14:53,098 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:14:53,098 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:14:53,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:14:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states. [2019-09-10 06:14:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 06:14:53,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:53,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,175 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1783202097, now seen corresponding path program 1 times [2019-09-10 06:14:53,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:53,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:53,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:53,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:54,217 INFO 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:14:54,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:54,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:54,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:54,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:54,242 INFO L87 Difference]: Start difference. First operand 922 states. Second operand 3 states. [2019-09-10 06:14:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:54,632 INFO L93 Difference]: Finished difference Result 1342 states and 2380 transitions. [2019-09-10 06:14:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:54,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-10 06:14:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:54,674 INFO L225 Difference]: With dead ends: 1342 [2019-09-10 06:14:54,674 INFO L226 Difference]: Without dead ends: 1334 [2019-09-10 06:14:54,677 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:14:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-10 06:14:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1332. [2019-09-10 06:14:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-09-10 06:14:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2035 transitions. [2019-09-10 06:14:54,855 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2035 transitions. Word has length 296 [2019-09-10 06:14:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:54,859 INFO L475 AbstractCegarLoop]: Abstraction has 1332 states and 2035 transitions. [2019-09-10 06:14:54,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2035 transitions. [2019-09-10 06:14:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 06:14:54,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:54,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:54,873 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1233933969, now seen corresponding path program 1 times [2019-09-10 06:14:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:54,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:55,257 INFO 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:14:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:55,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:55,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:55,262 INFO L87 Difference]: Start difference. First operand 1332 states and 2035 transitions. Second operand 3 states. [2019-09-10 06:14:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:55,650 INFO L93 Difference]: Finished difference Result 2184 states and 3347 transitions. [2019-09-10 06:14:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:55,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-10 06:14:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:55,664 INFO L225 Difference]: With dead ends: 2184 [2019-09-10 06:14:55,664 INFO L226 Difference]: Without dead ends: 2184 [2019-09-10 06:14:55,666 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:14:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-10 06:14:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2182. [2019-09-10 06:14:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-09-10 06:14:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3346 transitions. [2019-09-10 06:14:55,743 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3346 transitions. Word has length 296 [2019-09-10 06:14:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:55,745 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3346 transitions. [2019-09-10 06:14:55,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3346 transitions. [2019-09-10 06:14:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 06:14:55,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:55,756 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:55,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1327845929, now seen corresponding path program 1 times [2019-09-10 06:14:55,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:55,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:55,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:56,676 INFO 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:14:56,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:56,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:56,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:56,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:56,679 INFO L87 Difference]: Start difference. First operand 2182 states and 3346 transitions. Second operand 4 states. [2019-09-10 06:14:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:56,891 INFO L93 Difference]: Finished difference Result 4280 states and 6520 transitions. [2019-09-10 06:14:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:56,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-10 06:14:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:56,913 INFO L225 Difference]: With dead ends: 4280 [2019-09-10 06:14:56,913 INFO L226 Difference]: Without dead ends: 4280 [2019-09-10 06:14:56,914 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:14:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2019-09-10 06:14:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4166. [2019-09-10 06:14:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-09-10 06:14:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6377 transitions. [2019-09-10 06:14:57,028 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6377 transitions. Word has length 296 [2019-09-10 06:14:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:57,029 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6377 transitions. [2019-09-10 06:14:57,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6377 transitions. [2019-09-10 06:14:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:14:57,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:57,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:57,040 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash -652490421, now seen corresponding path program 1 times [2019-09-10 06:14:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:57,318 INFO 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:14:57,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:57,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:57,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:57,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:57,321 INFO L87 Difference]: Start difference. First operand 4166 states and 6377 transitions. Second operand 3 states. [2019-09-10 06:14:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:57,489 INFO L93 Difference]: Finished difference Result 8177 states and 12437 transitions. [2019-09-10 06:14:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:57,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-10 06:14:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:57,534 INFO L225 Difference]: With dead ends: 8177 [2019-09-10 06:14:57,535 INFO L226 Difference]: Without dead ends: 8177 [2019-09-10 06:14:57,535 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:14:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8177 states. [2019-09-10 06:14:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8177 to 8063. [2019-09-10 06:14:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-09-10 06:14:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 12294 transitions. [2019-09-10 06:14:57,850 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 12294 transitions. Word has length 298 [2019-09-10 06:14:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:57,850 INFO L475 AbstractCegarLoop]: Abstraction has 8063 states and 12294 transitions. [2019-09-10 06:14:57,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 12294 transitions. [2019-09-10 06:14:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:14:57,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:57,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:57,875 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1799086512, now seen corresponding path program 1 times [2019-09-10 06:14:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:58,023 INFO 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:14:58,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:58,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:58,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:58,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:58,025 INFO L87 Difference]: Start difference. First operand 8063 states and 12294 transitions. Second operand 3 states. [2019-09-10 06:14:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:58,117 INFO L93 Difference]: Finished difference Result 16093 states and 24528 transitions. [2019-09-10 06:14:58,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:58,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-10 06:14:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:58,182 INFO L225 Difference]: With dead ends: 16093 [2019-09-10 06:14:58,182 INFO L226 Difference]: Without dead ends: 16093 [2019-09-10 06:14:58,183 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:14:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16093 states. [2019-09-10 06:14:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16093 to 8082. [2019-09-10 06:14:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8082 states. [2019-09-10 06:14:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8082 states to 8082 states and 12322 transitions. [2019-09-10 06:14:58,454 INFO L78 Accepts]: Start accepts. Automaton has 8082 states and 12322 transitions. Word has length 298 [2019-09-10 06:14:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:58,455 INFO L475 AbstractCegarLoop]: Abstraction has 8082 states and 12322 transitions. [2019-09-10 06:14:58,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8082 states and 12322 transitions. [2019-09-10 06:14:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-10 06:14:58,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:58,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:58,472 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -249805897, now seen corresponding path program 1 times [2019-09-10 06:14:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:58,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:58,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:58,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:58,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:58,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:58,711 INFO L87 Difference]: Start difference. First operand 8082 states and 12322 transitions. Second operand 3 states. [2019-09-10 06:14:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:58,790 INFO L93 Difference]: Finished difference Result 16111 states and 24549 transitions. [2019-09-10 06:14:58,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:58,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-10 06:14:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:58,830 INFO L225 Difference]: With dead ends: 16111 [2019-09-10 06:14:58,830 INFO L226 Difference]: Without dead ends: 16111 [2019-09-10 06:14:58,831 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:14:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16111 states. [2019-09-10 06:14:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16111 to 8100. [2019-09-10 06:14:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-10 06:14:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 12343 transitions. [2019-09-10 06:14:59,029 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 12343 transitions. Word has length 299 [2019-09-10 06:14:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:59,031 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 12343 transitions. [2019-09-10 06:14:59,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 12343 transitions. [2019-09-10 06:14:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:14:59,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:59,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:59,052 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 582816003, now seen corresponding path program 1 times [2019-09-10 06:14:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:59,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:59,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:59,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:59,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:59,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:59,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:59,444 INFO L87 Difference]: Start difference. First operand 8100 states and 12343 transitions. Second operand 4 states. [2019-09-10 06:14:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:59,558 INFO L93 Difference]: Finished difference Result 16038 states and 24398 transitions. [2019-09-10 06:14:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:59,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-10 06:14:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:59,593 INFO L225 Difference]: With dead ends: 16038 [2019-09-10 06:14:59,593 INFO L226 Difference]: Without dead ends: 16038 [2019-09-10 06:14:59,594 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:14:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-09-10 06:14:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 8307. [2019-09-10 06:14:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-09-10 06:14:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 12696 transitions. [2019-09-10 06:14:59,842 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 12696 transitions. Word has length 300 [2019-09-10 06:14:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:59,842 INFO L475 AbstractCegarLoop]: Abstraction has 8307 states and 12696 transitions. [2019-09-10 06:14:59,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 12696 transitions. [2019-09-10 06:14:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:14:59,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:59,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:59,861 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1998808230, now seen corresponding path program 1 times [2019-09-10 06:14:59,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:00,148 INFO 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:15:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:00,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:00,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:00,151 INFO L87 Difference]: Start difference. First operand 8307 states and 12696 transitions. Second operand 3 states. [2019-09-10 06:15:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:00,311 INFO L93 Difference]: Finished difference Result 15204 states and 23014 transitions. [2019-09-10 06:15:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:00,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:15:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:00,345 INFO L225 Difference]: With dead ends: 15204 [2019-09-10 06:15:00,345 INFO L226 Difference]: Without dead ends: 15204 [2019-09-10 06:15:00,345 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:15:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2019-09-10 06:15:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15090. [2019-09-10 06:15:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15090 states. [2019-09-10 06:15:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15090 states to 15090 states and 22871 transitions. [2019-09-10 06:15:00,589 INFO L78 Accepts]: Start accepts. Automaton has 15090 states and 22871 transitions. Word has length 300 [2019-09-10 06:15:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:00,589 INFO L475 AbstractCegarLoop]: Abstraction has 15090 states and 22871 transitions. [2019-09-10 06:15:00,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 15090 states and 22871 transitions. [2019-09-10 06:15:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:15:00,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:00,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:00,622 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1260366970, now seen corresponding path program 1 times [2019-09-10 06:15:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:00,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:00,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:00,805 INFO 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:15:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:00,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:00,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:00,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:00,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:00,808 INFO L87 Difference]: Start difference. First operand 15090 states and 22871 transitions. Second operand 3 states. [2019-09-10 06:15:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:00,943 INFO L93 Difference]: Finished difference Result 29413 states and 44386 transitions. [2019-09-10 06:15:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:00,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:15:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:01,021 INFO L225 Difference]: With dead ends: 29413 [2019-09-10 06:15:01,021 INFO L226 Difference]: Without dead ends: 29413 [2019-09-10 06:15:01,022 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:15:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29413 states. [2019-09-10 06:15:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29413 to 15194. [2019-09-10 06:15:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15194 states. [2019-09-10 06:15:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15194 states to 15194 states and 23014 transitions. [2019-09-10 06:15:01,994 INFO L78 Accepts]: Start accepts. Automaton has 15194 states and 23014 transitions. Word has length 302 [2019-09-10 06:15:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:01,994 INFO L475 AbstractCegarLoop]: Abstraction has 15194 states and 23014 transitions. [2019-09-10 06:15:01,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15194 states and 23014 transitions. [2019-09-10 06:15:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-10 06:15:02,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:02,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:02,025 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1610108247, now seen corresponding path program 1 times [2019-09-10 06:15:02,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:02,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:02,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:02,188 INFO 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:15:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:02,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:02,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:02,193 INFO L87 Difference]: Start difference. First operand 15194 states and 23014 transitions. Second operand 3 states. [2019-09-10 06:15:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:02,315 INFO L93 Difference]: Finished difference Result 29538 states and 44532 transitions. [2019-09-10 06:15:02,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:02,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-10 06:15:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:02,387 INFO L225 Difference]: With dead ends: 29538 [2019-09-10 06:15:02,387 INFO L226 Difference]: Without dead ends: 29538 [2019-09-10 06:15:02,388 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:15:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29538 states. [2019-09-10 06:15:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29538 to 15319. [2019-09-10 06:15:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-09-10 06:15:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 23160 transitions. [2019-09-10 06:15:02,702 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 23160 transitions. Word has length 303 [2019-09-10 06:15:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:02,702 INFO L475 AbstractCegarLoop]: Abstraction has 15319 states and 23160 transitions. [2019-09-10 06:15:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 23160 transitions. [2019-09-10 06:15:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:15:02,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:02,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:02,735 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:02,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:02,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1962608313, now seen corresponding path program 1 times [2019-09-10 06:15:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:02,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:02,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:03,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:03,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:03,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:03,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:03,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:03,318 INFO L87 Difference]: Start difference. First operand 15319 states and 23160 transitions. Second operand 4 states. [2019-09-10 06:15:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:03,523 INFO L93 Difference]: Finished difference Result 17023 states and 25611 transitions. [2019-09-10 06:15:03,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:03,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-10 06:15:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:03,567 INFO L225 Difference]: With dead ends: 17023 [2019-09-10 06:15:03,567 INFO L226 Difference]: Without dead ends: 16275 [2019-09-10 06:15:03,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-09-10 06:15:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 16161. [2019-09-10 06:15:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16161 states. [2019-09-10 06:15:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16161 states to 16161 states and 24331 transitions. [2019-09-10 06:15:03,832 INFO L78 Accepts]: Start accepts. Automaton has 16161 states and 24331 transitions. Word has length 304 [2019-09-10 06:15:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:03,832 INFO L475 AbstractCegarLoop]: Abstraction has 16161 states and 24331 transitions. [2019-09-10 06:15:03,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16161 states and 24331 transitions. [2019-09-10 06:15:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:15:03,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:03,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,857 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 347631051, now seen corresponding path program 1 times [2019-09-10 06:15:03,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:03,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:04,033 INFO 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:15:04,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:04,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:04,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:04,036 INFO L87 Difference]: Start difference. First operand 16161 states and 24331 transitions. Second operand 3 states. [2019-09-10 06:15:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:04,154 INFO L93 Difference]: Finished difference Result 31855 states and 47846 transitions. [2019-09-10 06:15:04,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:04,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:15:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:04,209 INFO L225 Difference]: With dead ends: 31855 [2019-09-10 06:15:04,213 INFO L226 Difference]: Without dead ends: 31855 [2019-09-10 06:15:04,214 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:15:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31855 states. [2019-09-10 06:15:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31855 to 16231. [2019-09-10 06:15:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16231 states. [2019-09-10 06:15:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16231 states to 16231 states and 24422 transitions. [2019-09-10 06:15:04,637 INFO L78 Accepts]: Start accepts. Automaton has 16231 states and 24422 transitions. Word has length 306 [2019-09-10 06:15:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:04,638 INFO L475 AbstractCegarLoop]: Abstraction has 16231 states and 24422 transitions. [2019-09-10 06:15:04,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16231 states and 24422 transitions. [2019-09-10 06:15:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:15:04,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:04,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,662 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1086048075, now seen corresponding path program 1 times [2019-09-10 06:15:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:04,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:05,180 INFO 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:15:05,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:05,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:05,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:05,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:05,183 INFO L87 Difference]: Start difference. First operand 16231 states and 24422 transitions. Second operand 4 states. [2019-09-10 06:15:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:05,324 INFO L93 Difference]: Finished difference Result 32189 states and 48383 transitions. [2019-09-10 06:15:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:05,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:15:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:05,364 INFO L225 Difference]: With dead ends: 32189 [2019-09-10 06:15:05,365 INFO L226 Difference]: Without dead ends: 32189 [2019-09-10 06:15:05,365 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:15:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32189 states. [2019-09-10 06:15:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32189 to 17068. [2019-09-10 06:15:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17068 states. [2019-09-10 06:15:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17068 states to 17068 states and 25811 transitions. [2019-09-10 06:15:05,694 INFO L78 Accepts]: Start accepts. Automaton has 17068 states and 25811 transitions. Word has length 306 [2019-09-10 06:15:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:05,694 INFO L475 AbstractCegarLoop]: Abstraction has 17068 states and 25811 transitions. [2019-09-10 06:15:05,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 17068 states and 25811 transitions. [2019-09-10 06:15:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:15:05,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:05,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:05,714 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1786389507, now seen corresponding path program 1 times [2019-09-10 06:15:05,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:05,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:05,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:05,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:05,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:05,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:05,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:05,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:05,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:05,936 INFO L87 Difference]: Start difference. First operand 17068 states and 25811 transitions. Second operand 3 states. [2019-09-10 06:15:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:06,120 INFO L93 Difference]: Finished difference Result 33118 states and 49659 transitions. [2019-09-10 06:15:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:06,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:15:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:06,163 INFO L225 Difference]: With dead ends: 33118 [2019-09-10 06:15:06,163 INFO L226 Difference]: Without dead ends: 33118 [2019-09-10 06:15:06,164 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:15:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33118 states. [2019-09-10 06:15:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33118 to 33024. [2019-09-10 06:15:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33024 states. [2019-09-10 06:15:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33024 states to 33024 states and 49548 transitions. [2019-09-10 06:15:06,768 INFO L78 Accepts]: Start accepts. Automaton has 33024 states and 49548 transitions. Word has length 306 [2019-09-10 06:15:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:06,769 INFO L475 AbstractCegarLoop]: Abstraction has 33024 states and 49548 transitions. [2019-09-10 06:15:06,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 33024 states and 49548 transitions. [2019-09-10 06:15:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:15:06,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:06,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:06,808 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1280012922, now seen corresponding path program 1 times [2019-09-10 06:15:06,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:06,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:06,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:06,964 INFO 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:15:06,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:06,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:06,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:06,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:06,966 INFO L87 Difference]: Start difference. First operand 33024 states and 49548 transitions. Second operand 3 states. [2019-09-10 06:15:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:07,161 INFO L93 Difference]: Finished difference Result 64475 states and 96388 transitions. [2019-09-10 06:15:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:07,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 06:15:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:07,246 INFO L225 Difference]: With dead ends: 64475 [2019-09-10 06:15:07,246 INFO L226 Difference]: Without dead ends: 64475 [2019-09-10 06:15:07,249 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:15:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64475 states. [2019-09-10 06:15:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64475 to 33316. [2019-09-10 06:15:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33316 states. [2019-09-10 06:15:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33316 states to 33316 states and 49886 transitions. [2019-09-10 06:15:07,823 INFO L78 Accepts]: Start accepts. Automaton has 33316 states and 49886 transitions. Word has length 307 [2019-09-10 06:15:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:07,824 INFO L475 AbstractCegarLoop]: Abstraction has 33316 states and 49886 transitions. [2019-09-10 06:15:07,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33316 states and 49886 transitions. [2019-09-10 06:15:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:15:07,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:07,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,860 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 151142115, now seen corresponding path program 1 times [2019-09-10 06:15:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:07,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:08,131 INFO 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:15:08,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:08,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:08,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:08,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:08,133 INFO L87 Difference]: Start difference. First operand 33316 states and 49886 transitions. Second operand 3 states. [2019-09-10 06:15:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:09,430 INFO L93 Difference]: Finished difference Result 56692 states and 84754 transitions. [2019-09-10 06:15:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:09,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:15:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:09,488 INFO L225 Difference]: With dead ends: 56692 [2019-09-10 06:15:09,488 INFO L226 Difference]: Without dead ends: 56692 [2019-09-10 06:15:09,489 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:15:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56692 states. [2019-09-10 06:15:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56692 to 56608. [2019-09-10 06:15:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56608 states. [2019-09-10 06:15:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56608 states to 56608 states and 84671 transitions. [2019-09-10 06:15:09,997 INFO L78 Accepts]: Start accepts. Automaton has 56608 states and 84671 transitions. Word has length 308 [2019-09-10 06:15:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:09,997 INFO L475 AbstractCegarLoop]: Abstraction has 56608 states and 84671 transitions. [2019-09-10 06:15:09,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56608 states and 84671 transitions. [2019-09-10 06:15:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:15:10,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,044 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash 150803491, now seen corresponding path program 1 times [2019-09-10 06:15:10,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:10,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:11,045 INFO 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:15:11,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:11,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:15:11,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:11,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:15:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:15:11,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:15:11,047 INFO L87 Difference]: Start difference. First operand 56608 states and 84671 transitions. Second operand 17 states. [2019-09-10 06:15:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:16,510 INFO L93 Difference]: Finished difference Result 157352 states and 236074 transitions. [2019-09-10 06:15:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:15:16,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 308 [2019-09-10 06:15:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:16,691 INFO L225 Difference]: With dead ends: 157352 [2019-09-10 06:15:16,691 INFO L226 Difference]: Without dead ends: 157352 [2019-09-10 06:15:16,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:15:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157352 states. [2019-09-10 06:15:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157352 to 110172. [2019-09-10 06:15:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110172 states. [2019-09-10 06:15:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110172 states to 110172 states and 163285 transitions. [2019-09-10 06:15:19,641 INFO L78 Accepts]: Start accepts. Automaton has 110172 states and 163285 transitions. Word has length 308 [2019-09-10 06:15:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:19,642 INFO L475 AbstractCegarLoop]: Abstraction has 110172 states and 163285 transitions. [2019-09-10 06:15:19,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:15:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 110172 states and 163285 transitions. [2019-09-10 06:15:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:15:19,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:19,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:19,724 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1283932160, now seen corresponding path program 1 times [2019-09-10 06:15:19,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:19,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:20,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:20,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:20,192 INFO L87 Difference]: Start difference. First operand 110172 states and 163285 transitions. Second operand 4 states. [2019-09-10 06:15:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:20,760 INFO L93 Difference]: Finished difference Result 213650 states and 314028 transitions. [2019-09-10 06:15:20,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:20,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:15:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:21,015 INFO L225 Difference]: With dead ends: 213650 [2019-09-10 06:15:21,015 INFO L226 Difference]: Without dead ends: 213650 [2019-09-10 06:15:21,015 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:15:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213650 states. [2019-09-10 06:15:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213650 to 213474. [2019-09-10 06:15:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213474 states. [2019-09-10 06:15:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213474 states to 213474 states and 313786 transitions. [2019-09-10 06:15:26,462 INFO L78 Accepts]: Start accepts. Automaton has 213474 states and 313786 transitions. Word has length 308 [2019-09-10 06:15:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:26,462 INFO L475 AbstractCegarLoop]: Abstraction has 213474 states and 313786 transitions. [2019-09-10 06:15:26,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 213474 states and 313786 transitions. [2019-09-10 06:15:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:15:26,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:26,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:26,606 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:26,607 INFO L82 PathProgramCache]: Analyzing trace with hash 326591893, now seen corresponding path program 1 times [2019-09-10 06:15:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:26,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:26,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:26,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:26,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:26,996 INFO L87 Difference]: Start difference. First operand 213474 states and 313786 transitions. Second operand 4 states. [2019-09-10 06:15:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:28,116 INFO L93 Difference]: Finished difference Result 417026 states and 608011 transitions. [2019-09-10 06:15:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:28,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:15:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:28,624 INFO L225 Difference]: With dead ends: 417026 [2019-09-10 06:15:28,624 INFO L226 Difference]: Without dead ends: 417026 [2019-09-10 06:15:28,624 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:15:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417026 states. [2019-09-10 06:15:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417026 to 416762. [2019-09-10 06:15:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416762 states. [2019-09-10 06:15:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416762 states to 416762 states and 607665 transitions. [2019-09-10 06:15:43,452 INFO L78 Accepts]: Start accepts. Automaton has 416762 states and 607665 transitions. Word has length 308 [2019-09-10 06:15:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:43,453 INFO L475 AbstractCegarLoop]: Abstraction has 416762 states and 607665 transitions. [2019-09-10 06:15:43,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 416762 states and 607665 transitions. [2019-09-10 06:15:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:15:43,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:43,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,752 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1083050158, now seen corresponding path program 1 times [2019-09-10 06:15:43,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:43,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:43,955 INFO 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:15:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:43,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:43,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:43,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:43,957 INFO L87 Difference]: Start difference. First operand 416762 states and 607665 transitions. Second operand 3 states. [2019-09-10 06:15:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:52,735 INFO L93 Difference]: Finished difference Result 816294 states and 1180615 transitions. [2019-09-10 06:15:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:52,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:15:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:53,849 INFO L225 Difference]: With dead ends: 816294 [2019-09-10 06:15:53,849 INFO L226 Difference]: Without dead ends: 816294 [2019-09-10 06:15:53,850 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:15:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816294 states. [2019-09-10 06:16:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816294 to 816030. [2019-09-10 06:16:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816030 states. [2019-09-10 06:16:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816030 states to 816030 states and 1180269 transitions. [2019-09-10 06:16:15,816 INFO L78 Accepts]: Start accepts. Automaton has 816030 states and 1180269 transitions. Word has length 310 [2019-09-10 06:16:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:15,816 INFO L475 AbstractCegarLoop]: Abstraction has 816030 states and 1180269 transitions. [2019-09-10 06:16:15,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 816030 states and 1180269 transitions. [2019-09-10 06:16:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:16:16,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:16,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:16,406 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash -63545933, now seen corresponding path program 1 times [2019-09-10 06:16:16,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:16,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:16,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:16,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:16,550 INFO 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:16:16,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:16,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:16,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:16,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:16,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:16,552 INFO L87 Difference]: Start difference. First operand 816030 states and 1180269 transitions. Second operand 3 states. [2019-09-10 06:16:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:28,980 INFO L93 Difference]: Finished difference Result 1625368 states and 2349885 transitions. [2019-09-10 06:16:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:28,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:16:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:32,468 INFO L225 Difference]: With dead ends: 1625368 [2019-09-10 06:16:32,468 INFO L226 Difference]: Without dead ends: 1625368 [2019-09-10 06:16:32,469 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:16:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625368 states. [2019-09-10 06:17:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625368 to 816340. [2019-09-10 06:17:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816340 states. [2019-09-10 06:17:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816340 states to 816340 states and 1180619 transitions. [2019-09-10 06:17:11,106 INFO L78 Accepts]: Start accepts. Automaton has 816340 states and 1180619 transitions. Word has length 310 [2019-09-10 06:17:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:11,106 INFO L475 AbstractCegarLoop]: Abstraction has 816340 states and 1180619 transitions. [2019-09-10 06:17:11,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 816340 states and 1180619 transitions. [2019-09-10 06:17:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:17:21,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:21,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,272 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1557154898, now seen corresponding path program 1 times [2019-09-10 06:17:21,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:21,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:21,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:21,413 INFO 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:17:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:21,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:21,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:21,415 INFO L87 Difference]: Start difference. First operand 816340 states and 1180619 transitions. Second operand 3 states. [2019-09-10 06:17:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:33,707 INFO L93 Difference]: Finished difference Result 1631231 states and 2358791 transitions. [2019-09-10 06:17:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:33,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:17:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:37,208 INFO L225 Difference]: With dead ends: 1631231 [2019-09-10 06:17:37,209 INFO L226 Difference]: Without dead ends: 1631231 [2019-09-10 06:17:37,209 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:17:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631231 states. [2019-09-10 06:18:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631231 to 816703. [2019-09-10 06:18:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816703 states. [2019-09-10 06:18:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816703 states to 816703 states and 1181035 transitions. [2019-09-10 06:18:15,232 INFO L78 Accepts]: Start accepts. Automaton has 816703 states and 1181035 transitions. Word has length 311 [2019-09-10 06:18:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:15,232 INFO L475 AbstractCegarLoop]: Abstraction has 816703 states and 1181035 transitions. [2019-09-10 06:18:15,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 816703 states and 1181035 transitions. [2019-09-10 06:18:15,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:18:15,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:15,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,887 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:15,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash 851162761, now seen corresponding path program 1 times [2019-09-10 06:18:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:15,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:16,088 INFO 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,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:16,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:16,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:16,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:16,090 INFO L87 Difference]: Start difference. First operand 816703 states and 1181035 transitions. Second operand 3 states. [2019-09-10 06:18:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:22,485 INFO L93 Difference]: Finished difference Result 1512741 states and 2166989 transitions. [2019-09-10 06:18:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:22,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:18:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:26,540 INFO L225 Difference]: With dead ends: 1512741 [2019-09-10 06:18:26,540 INFO L226 Difference]: Without dead ends: 1512741 [2019-09-10 06:18:26,541 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:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512741 states. [2019-09-10 06:19:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512741 to 1512477. [2019-09-10 06:19:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512477 states. [2019-09-10 06:19:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512477 states to 1512477 states and 2166643 transitions. [2019-09-10 06:19:33,379 INFO L78 Accepts]: Start accepts. Automaton has 1512477 states and 2166643 transitions. Word has length 312 [2019-09-10 06:19:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:33,379 INFO L475 AbstractCegarLoop]: Abstraction has 1512477 states and 2166643 transitions. [2019-09-10 06:19:33,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1512477 states and 2166643 transitions. [2019-09-10 06:19:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:19:34,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:34,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,677 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:34,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:34,678 INFO L82 PathProgramCache]: Analyzing trace with hash -564829466, now seen corresponding path program 1 times [2019-09-10 06:19:34,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:34,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:34,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:34,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:34,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:42,634 INFO 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:42,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:42,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:42,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:42,636 INFO L87 Difference]: Start difference. First operand 1512477 states and 2166643 transitions. Second operand 4 states. [2019-09-10 06:20:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:06,736 INFO L93 Difference]: Finished difference Result 2909064 states and 4164184 transitions. [2019-09-10 06:20:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:06,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:20:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:12,424 INFO L225 Difference]: With dead ends: 2909064 [2019-09-10 06:20:12,425 INFO L226 Difference]: Without dead ends: 2909064 [2019-09-10 06:20:12,425 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:20:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909064 states.