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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:47:47,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:47:47,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:47:47,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:47:47,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:47:47,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:47:47,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:47:47,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:47:47,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:47:47,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:47:47,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:47:47,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:47:47,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:47:47,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:47:47,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:47:47,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:47:47,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:47:47,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:47:47,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:47:47,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:47:47,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:47:47,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:47:47,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:47:47,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:47:47,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:47:47,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:47:47,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:47:47,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:47:47,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:47:47,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:47:47,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:47:47,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:47:47,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:47:47,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:47:47,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:47:47,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:47:47,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:47:47,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:47:47,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:47:47,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:47:47,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:47:47,118 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 08:47:47,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:47:47,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:47:47,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:47:47,134 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:47:47,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:47:47,135 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:47:47,135 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:47:47,135 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:47:47,136 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:47:47,136 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:47:47,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:47:47,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:47:47,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:47:47,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:47:47,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:47:47,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:47:47,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:47:47,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:47:47,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:47:47,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:47:47,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:47:47,139 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:47:47,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:47:47,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:47:47,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:47:47,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:47:47,140 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:47:47,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:47:47,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:47:47,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:47:47,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:47:47,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:47:47,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:47:47,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:47:47,197 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:47:47,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:47:47,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15ce066d/1990d5007a37483ab3bba8284e8be8b9/FLAGa0624cac4 [2019-09-10 08:47:47,944 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:47:47,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:47:47,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15ce066d/1990d5007a37483ab3bba8284e8be8b9/FLAGa0624cac4 [2019-09-10 08:47:48,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15ce066d/1990d5007a37483ab3bba8284e8be8b9 [2019-09-10 08:47:48,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:47:48,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:47:48,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:48,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:47:48,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:47:48,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:48" (1/1) ... [2019-09-10 08:47:48,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137f403b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:48, skipping insertion in model container [2019-09-10 08:47:48,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:48" (1/1) ... [2019-09-10 08:47:48,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:47:48,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:47:49,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:49,709 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:47:50,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:50,666 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:47:50,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50 WrapperNode [2019-09-10 08:47:50,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:50,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:47:50,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:47:50,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:47:50,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (1/1) ... [2019-09-10 08:47:50,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:47:50,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:47:50,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:47:50,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:47:50,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (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 08:47:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:47:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:47:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:47:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:47:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:47:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:47:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:47:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:47:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:47:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:47:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:47:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:47:54,169 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:47:54,170 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:47:54,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:54 BoogieIcfgContainer [2019-09-10 08:47:54,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:47:54,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:47:54,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:47:54,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:47:54,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:47:48" (1/3) ... [2019-09-10 08:47:54,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0d267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:54, skipping insertion in model container [2019-09-10 08:47:54,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:50" (2/3) ... [2019-09-10 08:47:54,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0d267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:54, skipping insertion in model container [2019-09-10 08:47:54,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:54" (3/3) ... [2019-09-10 08:47:54,180 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:47:54,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:47:54,200 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 08:47:54,219 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 08:47:54,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:47:54,252 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:47:54,252 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:47:54,253 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:47:54,253 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:47:54,253 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:47:54,253 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:47:54,253 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:47:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states. [2019-09-10 08:47:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:54,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:54,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:54,357 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1980660841, now seen corresponding path program 1 times [2019-09-10 08:47:54,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:54,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:54,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:54,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:55,366 INFO 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 08:47:55,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:55,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:55,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:55,393 INFO L87 Difference]: Start difference. First operand 1004 states. Second operand 3 states. [2019-09-10 08:47:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:55,713 INFO L93 Difference]: Finished difference Result 1465 states and 2581 transitions. [2019-09-10 08:47:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:55,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:55,758 INFO L225 Difference]: With dead ends: 1465 [2019-09-10 08:47:55,758 INFO L226 Difference]: Without dead ends: 1457 [2019-09-10 08:47:55,760 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 08:47:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-09-10 08:47:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1455. [2019-09-10 08:47:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-09-10 08:47:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2235 transitions. [2019-09-10 08:47:55,881 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2235 transitions. Word has length 312 [2019-09-10 08:47:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:55,883 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2235 transitions. [2019-09-10 08:47:55,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2235 transitions. [2019-09-10 08:47:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:55,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:55,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:55,892 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash 122735285, now seen corresponding path program 1 times [2019-09-10 08:47:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:56,357 INFO 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 08:47:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:56,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:56,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:56,365 INFO L87 Difference]: Start difference. First operand 1455 states and 2235 transitions. Second operand 3 states. [2019-09-10 08:47:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:56,632 INFO L93 Difference]: Finished difference Result 2369 states and 3654 transitions. [2019-09-10 08:47:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:56,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:56,654 INFO L225 Difference]: With dead ends: 2369 [2019-09-10 08:47:56,655 INFO L226 Difference]: Without dead ends: 2369 [2019-09-10 08:47:56,657 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 08:47:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-09-10 08:47:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2367. [2019-09-10 08:47:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-09-10 08:47:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3653 transitions. [2019-09-10 08:47:56,753 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3653 transitions. Word has length 312 [2019-09-10 08:47:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:56,756 INFO L475 AbstractCegarLoop]: Abstraction has 2367 states and 3653 transitions. [2019-09-10 08:47:56,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3653 transitions. [2019-09-10 08:47:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:56,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:56,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:56,775 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1622377659, now seen corresponding path program 1 times [2019-09-10 08:47:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:56,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:56,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:57,713 INFO 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 08:47:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:57,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:57,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:57,716 INFO L87 Difference]: Start difference. First operand 2367 states and 3653 transitions. Second operand 4 states. [2019-09-10 08:47:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:57,916 INFO L93 Difference]: Finished difference Result 4638 states and 7113 transitions. [2019-09-10 08:47:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:57,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 08:47:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:57,947 INFO L225 Difference]: With dead ends: 4638 [2019-09-10 08:47:57,947 INFO L226 Difference]: Without dead ends: 4638 [2019-09-10 08:47:57,947 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 08:47:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2019-09-10 08:47:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4534. [2019-09-10 08:47:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4534 states. [2019-09-10 08:47:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 6986 transitions. [2019-09-10 08:47:58,078 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 6986 transitions. Word has length 312 [2019-09-10 08:47:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:58,078 INFO L475 AbstractCegarLoop]: Abstraction has 4534 states and 6986 transitions. [2019-09-10 08:47:58,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 6986 transitions. [2019-09-10 08:47:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:47:58,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:58,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:58,092 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1163281230, now seen corresponding path program 1 times [2019-09-10 08:47:58,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:58,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:58,302 INFO 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 08:47:58,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:58,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:58,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:58,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:58,304 INFO L87 Difference]: Start difference. First operand 4534 states and 6986 transitions. Second operand 3 states. [2019-09-10 08:47:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:58,410 INFO L93 Difference]: Finished difference Result 9048 states and 13937 transitions. [2019-09-10 08:47:58,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:58,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:47:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:58,469 INFO L225 Difference]: With dead ends: 9048 [2019-09-10 08:47:58,470 INFO L226 Difference]: Without dead ends: 9048 [2019-09-10 08:47:58,470 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 08:47:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9048 states. [2019-09-10 08:47:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9048 to 4547. [2019-09-10 08:47:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4547 states. [2019-09-10 08:47:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 7005 transitions. [2019-09-10 08:47:58,681 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 7005 transitions. Word has length 314 [2019-09-10 08:47:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:58,681 INFO L475 AbstractCegarLoop]: Abstraction has 4547 states and 7005 transitions. [2019-09-10 08:47:58,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 7005 transitions. [2019-09-10 08:47:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:47:58,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:58,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:58,697 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -542730167, now seen corresponding path program 1 times [2019-09-10 08:47:58,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:58,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:58,963 INFO 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 08:47:58,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:58,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:58,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:58,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:58,966 INFO L87 Difference]: Start difference. First operand 4547 states and 7005 transitions. Second operand 3 states. [2019-09-10 08:47:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:59,126 INFO L93 Difference]: Finished difference Result 8909 states and 13642 transitions. [2019-09-10 08:47:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:59,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:47:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:59,172 INFO L225 Difference]: With dead ends: 8909 [2019-09-10 08:47:59,173 INFO L226 Difference]: Without dead ends: 8909 [2019-09-10 08:47:59,173 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 08:47:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8909 states. [2019-09-10 08:47:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8909 to 8805. [2019-09-10 08:47:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8805 states. [2019-09-10 08:47:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8805 states to 8805 states and 13515 transitions. [2019-09-10 08:47:59,445 INFO L78 Accepts]: Start accepts. Automaton has 8805 states and 13515 transitions. Word has length 314 [2019-09-10 08:47:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:59,445 INFO L475 AbstractCegarLoop]: Abstraction has 8805 states and 13515 transitions. [2019-09-10 08:47:59,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8805 states and 13515 transitions. [2019-09-10 08:47:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 08:47:59,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:59,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:59,467 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash -186969393, now seen corresponding path program 1 times [2019-09-10 08:47:59,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:59,664 INFO 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 08:47:59,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:59,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:59,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:59,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:59,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:59,666 INFO L87 Difference]: Start difference. First operand 8805 states and 13515 transitions. Second operand 3 states. [2019-09-10 08:47:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:59,787 INFO L93 Difference]: Finished difference Result 17557 states and 26935 transitions. [2019-09-10 08:47:59,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:59,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 08:47:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:59,840 INFO L225 Difference]: With dead ends: 17557 [2019-09-10 08:47:59,840 INFO L226 Difference]: Without dead ends: 17557 [2019-09-10 08:47:59,841 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 08:47:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2019-09-10 08:48:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 8823. [2019-09-10 08:48:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-09-10 08:48:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 13536 transitions. [2019-09-10 08:48:00,098 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 13536 transitions. Word has length 315 [2019-09-10 08:48:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:00,098 INFO L475 AbstractCegarLoop]: Abstraction has 8823 states and 13536 transitions. [2019-09-10 08:48:00,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 13536 transitions. [2019-09-10 08:48:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:48:00,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:00,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:00,118 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:00,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1296376036, now seen corresponding path program 1 times [2019-09-10 08:48:00,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:00,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:00,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:00,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:00,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:00,448 INFO L87 Difference]: Start difference. First operand 8823 states and 13536 transitions. Second operand 3 states. [2019-09-10 08:48:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:00,582 INFO L93 Difference]: Finished difference Result 16308 states and 24836 transitions. [2019-09-10 08:48:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:00,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 08:48:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:00,618 INFO L225 Difference]: With dead ends: 16308 [2019-09-10 08:48:00,619 INFO L226 Difference]: Without dead ends: 16308 [2019-09-10 08:48:00,619 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 08:48:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16308 states. [2019-09-10 08:48:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16308 to 16204. [2019-09-10 08:48:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16204 states. [2019-09-10 08:48:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16204 states to 16204 states and 24709 transitions. [2019-09-10 08:48:00,941 INFO L78 Accepts]: Start accepts. Automaton has 16204 states and 24709 transitions. Word has length 316 [2019-09-10 08:48:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:00,942 INFO L475 AbstractCegarLoop]: Abstraction has 16204 states and 24709 transitions. [2019-09-10 08:48:00,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 16204 states and 24709 transitions. [2019-09-10 08:48:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:48:00,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:00,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:00,972 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash 364671809, now seen corresponding path program 1 times [2019-09-10 08:48:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:01,449 INFO 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 08:48:01,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:01,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:01,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:01,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:01,452 INFO L87 Difference]: Start difference. First operand 16204 states and 24709 transitions. Second operand 4 states. [2019-09-10 08:48:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:01,597 INFO L93 Difference]: Finished difference Result 30996 states and 47154 transitions. [2019-09-10 08:48:01,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:01,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 08:48:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:01,656 INFO L225 Difference]: With dead ends: 30996 [2019-09-10 08:48:01,657 INFO L226 Difference]: Without dead ends: 30996 [2019-09-10 08:48:01,657 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 08:48:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30996 states. [2019-09-10 08:48:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30996 to 16439. [2019-09-10 08:48:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16439 states. [2019-09-10 08:48:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16439 states to 16439 states and 25097 transitions. [2019-09-10 08:48:02,004 INFO L78 Accepts]: Start accepts. Automaton has 16439 states and 25097 transitions. Word has length 316 [2019-09-10 08:48:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:02,005 INFO L475 AbstractCegarLoop]: Abstraction has 16439 states and 25097 transitions. [2019-09-10 08:48:02,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 16439 states and 25097 transitions. [2019-09-10 08:48:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:48:02,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:02,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:02,033 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1310214227, now seen corresponding path program 1 times [2019-09-10 08:48:02,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:02,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:02,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:02,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:02,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:02,224 INFO 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 08:48:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:02,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:02,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:02,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:02,227 INFO L87 Difference]: Start difference. First operand 16439 states and 25097 transitions. Second operand 3 states. [2019-09-10 08:48:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:02,365 INFO L93 Difference]: Finished difference Result 25359 states and 38988 transitions. [2019-09-10 08:48:02,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:02,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:48:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:02,412 INFO L225 Difference]: With dead ends: 25359 [2019-09-10 08:48:02,413 INFO L226 Difference]: Without dead ends: 25359 [2019-09-10 08:48:02,414 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 08:48:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25359 states. [2019-09-10 08:48:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25359 to 20267. [2019-09-10 08:48:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20267 states. [2019-09-10 08:48:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20267 states to 20267 states and 31399 transitions. [2019-09-10 08:48:03,316 INFO L78 Accepts]: Start accepts. Automaton has 20267 states and 31399 transitions. Word has length 318 [2019-09-10 08:48:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:03,316 INFO L475 AbstractCegarLoop]: Abstraction has 20267 states and 31399 transitions. [2019-09-10 08:48:03,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20267 states and 31399 transitions. [2019-09-10 08:48:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:48:03,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:03,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:03,347 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1078345510, now seen corresponding path program 1 times [2019-09-10 08:48:03,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:03,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:03,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:03,495 INFO 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 08:48:03,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:03,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:03,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:03,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:03,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:03,498 INFO L87 Difference]: Start difference. First operand 20267 states and 31399 transitions. Second operand 3 states. [2019-09-10 08:48:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:03,646 INFO L93 Difference]: Finished difference Result 39767 states and 61442 transitions. [2019-09-10 08:48:03,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:03,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:48:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:03,736 INFO L225 Difference]: With dead ends: 39767 [2019-09-10 08:48:03,736 INFO L226 Difference]: Without dead ends: 39767 [2019-09-10 08:48:03,737 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 08:48:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39767 states. [2019-09-10 08:48:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39767 to 20371. [2019-09-10 08:48:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-09-10 08:48:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 31542 transitions. [2019-09-10 08:48:04,108 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 31542 transitions. Word has length 318 [2019-09-10 08:48:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:04,108 INFO L475 AbstractCegarLoop]: Abstraction has 20371 states and 31542 transitions. [2019-09-10 08:48:04,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 31542 transitions. [2019-09-10 08:48:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 08:48:04,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:04,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:04,150 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash -380172961, now seen corresponding path program 1 times [2019-09-10 08:48:04,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:04,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:04,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:04,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:04,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:04,524 INFO L87 Difference]: Start difference. First operand 20371 states and 31542 transitions. Second operand 3 states. [2019-09-10 08:48:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:04,659 INFO L93 Difference]: Finished difference Result 39892 states and 61588 transitions. [2019-09-10 08:48:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:04,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-10 08:48:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:04,723 INFO L225 Difference]: With dead ends: 39892 [2019-09-10 08:48:04,724 INFO L226 Difference]: Without dead ends: 39892 [2019-09-10 08:48:04,725 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 08:48:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39892 states. [2019-09-10 08:48:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39892 to 20496. [2019-09-10 08:48:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-09-10 08:48:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 31688 transitions. [2019-09-10 08:48:05,136 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 31688 transitions. Word has length 319 [2019-09-10 08:48:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:05,136 INFO L475 AbstractCegarLoop]: Abstraction has 20496 states and 31688 transitions. [2019-09-10 08:48:05,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 31688 transitions. [2019-09-10 08:48:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:48:05,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:05,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:05,160 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1072562062, now seen corresponding path program 1 times [2019-09-10 08:48:05,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:05,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:05,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:05,343 INFO 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 08:48:05,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:05,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:05,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:05,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:05,346 INFO L87 Difference]: Start difference. First operand 20496 states and 31688 transitions. Second operand 3 states. [2019-09-10 08:48:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:05,548 INFO L93 Difference]: Finished difference Result 31406 states and 48867 transitions. [2019-09-10 08:48:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:05,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:48:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:05,600 INFO L225 Difference]: With dead ends: 31406 [2019-09-10 08:48:05,604 INFO L226 Difference]: Without dead ends: 31406 [2019-09-10 08:48:05,605 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 08:48:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31406 states. [2019-09-10 08:48:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31406 to 27332. [2019-09-10 08:48:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27332 states. [2019-09-10 08:48:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27332 states to 27332 states and 42883 transitions. [2019-09-10 08:48:06,192 INFO L78 Accepts]: Start accepts. Automaton has 27332 states and 42883 transitions. Word has length 320 [2019-09-10 08:48:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:06,193 INFO L475 AbstractCegarLoop]: Abstraction has 27332 states and 42883 transitions. [2019-09-10 08:48:06,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 27332 states and 42883 transitions. [2019-09-10 08:48:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:48:06,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:06,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:06,210 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -835465447, now seen corresponding path program 1 times [2019-09-10 08:48:06,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:06,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:06,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:06,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:06,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:06,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:06,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:06,692 INFO L87 Difference]: Start difference. First operand 27332 states and 42883 transitions. Second operand 4 states. [2019-09-10 08:48:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:06,889 INFO L93 Difference]: Finished difference Result 29110 states and 45322 transitions. [2019-09-10 08:48:06,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:06,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 08:48:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:06,927 INFO L225 Difference]: With dead ends: 29110 [2019-09-10 08:48:06,927 INFO L226 Difference]: Without dead ends: 28320 [2019-09-10 08:48:06,927 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 08:48:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28320 states. [2019-09-10 08:48:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28320 to 28216. [2019-09-10 08:48:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28216 states. [2019-09-10 08:48:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28216 states to 28216 states and 44004 transitions. [2019-09-10 08:48:07,206 INFO L78 Accepts]: Start accepts. Automaton has 28216 states and 44004 transitions. Word has length 320 [2019-09-10 08:48:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:07,207 INFO L475 AbstractCegarLoop]: Abstraction has 28216 states and 44004 transitions. [2019-09-10 08:48:07,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28216 states and 44004 transitions. [2019-09-10 08:48:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:48:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:07,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:07,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1341864004, now seen corresponding path program 1 times [2019-09-10 08:48:07,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:07,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:08,120 INFO 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 08:48:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:48:08,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:08,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:48:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:48:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:48:08,122 INFO L87 Difference]: Start difference. First operand 28216 states and 44004 transitions. Second operand 10 states. [2019-09-10 08:48:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:10,876 INFO L93 Difference]: Finished difference Result 74887 states and 117286 transitions. [2019-09-10 08:48:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:48:10,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2019-09-10 08:48:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:10,977 INFO L225 Difference]: With dead ends: 74887 [2019-09-10 08:48:10,977 INFO L226 Difference]: Without dead ends: 74887 [2019-09-10 08:48:10,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:48:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74887 states. [2019-09-10 08:48:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74887 to 50756. [2019-09-10 08:48:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50756 states. [2019-09-10 08:48:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50756 states to 50756 states and 79477 transitions. [2019-09-10 08:48:12,506 INFO L78 Accepts]: Start accepts. Automaton has 50756 states and 79477 transitions. Word has length 321 [2019-09-10 08:48:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:12,507 INFO L475 AbstractCegarLoop]: Abstraction has 50756 states and 79477 transitions. [2019-09-10 08:48:12,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:48:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 50756 states and 79477 transitions. [2019-09-10 08:48:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:48:12,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:12,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:12,527 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1635752524, now seen corresponding path program 1 times [2019-09-10 08:48:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:12,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:12,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:13,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:13,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:13,240 INFO L87 Difference]: Start difference. First operand 50756 states and 79477 transitions. Second operand 4 states. [2019-09-10 08:48:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:13,617 INFO L93 Difference]: Finished difference Result 98974 states and 154233 transitions. [2019-09-10 08:48:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:13,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-10 08:48:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:13,748 INFO L225 Difference]: With dead ends: 98974 [2019-09-10 08:48:13,748 INFO L226 Difference]: Without dead ends: 98974 [2019-09-10 08:48:13,749 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 08:48:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98974 states. [2019-09-10 08:48:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98974 to 98877. [2019-09-10 08:48:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98877 states. [2019-09-10 08:48:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98877 states to 98877 states and 154115 transitions. [2019-09-10 08:48:15,168 INFO L78 Accepts]: Start accepts. Automaton has 98877 states and 154115 transitions. Word has length 321 [2019-09-10 08:48:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:15,168 INFO L475 AbstractCegarLoop]: Abstraction has 98877 states and 154115 transitions. [2019-09-10 08:48:15,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 98877 states and 154115 transitions. [2019-09-10 08:48:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:48:15,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:15,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:15,201 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 851278383, now seen corresponding path program 1 times [2019-09-10 08:48:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:15,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:15,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:15,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:15,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:15,563 INFO L87 Difference]: Start difference. First operand 98877 states and 154115 transitions. Second operand 4 states. [2019-09-10 08:48:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:16,152 INFO L93 Difference]: Finished difference Result 197152 states and 307216 transitions. [2019-09-10 08:48:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:16,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 08:48:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:16,371 INFO L225 Difference]: With dead ends: 197152 [2019-09-10 08:48:16,371 INFO L226 Difference]: Without dead ends: 197152 [2019-09-10 08:48:16,372 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 08:48:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197152 states. [2019-09-10 08:48:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197152 to 99906. [2019-09-10 08:48:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99906 states. [2019-09-10 08:48:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99906 states to 99906 states and 155839 transitions. [2019-09-10 08:48:20,274 INFO L78 Accepts]: Start accepts. Automaton has 99906 states and 155839 transitions. Word has length 322 [2019-09-10 08:48:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:20,275 INFO L475 AbstractCegarLoop]: Abstraction has 99906 states and 155839 transitions. [2019-09-10 08:48:20,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 99906 states and 155839 transitions. [2019-09-10 08:48:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:48:20,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:20,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:20,306 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1803740479, now seen corresponding path program 1 times [2019-09-10 08:48:20,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:20,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:20,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:20,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:20,585 INFO L87 Difference]: Start difference. First operand 99906 states and 155839 transitions. Second operand 3 states. [2019-09-10 08:48:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:21,600 INFO L93 Difference]: Finished difference Result 194483 states and 301522 transitions. [2019-09-10 08:48:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:21,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:48:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:21,797 INFO L225 Difference]: With dead ends: 194483 [2019-09-10 08:48:21,797 INFO L226 Difference]: Without dead ends: 194483 [2019-09-10 08:48:21,798 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 08:48:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194483 states. [2019-09-10 08:48:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194483 to 194390. [2019-09-10 08:48:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194390 states. [2019-09-10 08:48:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194390 states to 194390 states and 301412 transitions. [2019-09-10 08:48:25,991 INFO L78 Accepts]: Start accepts. Automaton has 194390 states and 301412 transitions. Word has length 322 [2019-09-10 08:48:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:25,991 INFO L475 AbstractCegarLoop]: Abstraction has 194390 states and 301412 transitions. [2019-09-10 08:48:25,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 194390 states and 301412 transitions. [2019-09-10 08:48:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 08:48:26,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:26,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:26,036 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1871689069, now seen corresponding path program 1 times [2019-09-10 08:48:26,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:26,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:26,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:26,252 INFO 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 08:48:26,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:26,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:26,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:26,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:26,254 INFO L87 Difference]: Start difference. First operand 194390 states and 301412 transitions. Second operand 3 states. [2019-09-10 08:48:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:27,302 INFO L93 Difference]: Finished difference Result 378743 states and 584868 transitions. [2019-09-10 08:48:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:27,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 08:48:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:27,853 INFO L225 Difference]: With dead ends: 378743 [2019-09-10 08:48:27,853 INFO L226 Difference]: Without dead ends: 378743 [2019-09-10 08:48:27,853 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 08:48:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378743 states. [2019-09-10 08:48:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378743 to 378647. [2019-09-10 08:48:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378647 states. [2019-09-10 08:48:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378647 states to 378647 states and 584753 transitions. [2019-09-10 08:48:35,998 INFO L78 Accepts]: Start accepts. Automaton has 378647 states and 584753 transitions. Word has length 323 [2019-09-10 08:48:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:35,999 INFO L475 AbstractCegarLoop]: Abstraction has 378647 states and 584753 transitions. [2019-09-10 08:48:35,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 378647 states and 584753 transitions. [2019-09-10 08:48:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:48:36,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:36,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:36,109 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -599969923, now seen corresponding path program 1 times [2019-09-10 08:48:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:36,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:42,355 INFO 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 08:48:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:42,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:42,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:42,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:42,358 INFO L87 Difference]: Start difference. First operand 378647 states and 584753 transitions. Second operand 4 states. [2019-09-10 08:48:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:43,884 INFO L93 Difference]: Finished difference Result 741960 states and 1141900 transitions. [2019-09-10 08:48:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:43,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:48:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:44,734 INFO L225 Difference]: With dead ends: 741960 [2019-09-10 08:48:44,734 INFO L226 Difference]: Without dead ends: 741960 [2019-09-10 08:48:44,736 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 08:48:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741960 states. [2019-09-10 08:49:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741960 to 741806. [2019-09-10 08:49:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741806 states. [2019-09-10 08:49:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741806 states to 741806 states and 1141715 transitions. [2019-09-10 08:49:11,647 INFO L78 Accepts]: Start accepts. Automaton has 741806 states and 1141715 transitions. Word has length 324 [2019-09-10 08:49:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:11,648 INFO L475 AbstractCegarLoop]: Abstraction has 741806 states and 1141715 transitions. [2019-09-10 08:49:11,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 741806 states and 1141715 transitions. [2019-09-10 08:49:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:49:11,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:11,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:11,815 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1416406792, now seen corresponding path program 1 times [2019-09-10 08:49:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:11,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:12,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:12,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:12,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:12,042 INFO L87 Difference]: Start difference. First operand 741806 states and 1141715 transitions. Second operand 3 states. [2019-09-10 08:49:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:23,127 INFO L93 Difference]: Finished difference Result 1455566 states and 2229562 transitions. [2019-09-10 08:49:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:23,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:49:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:25,274 INFO L225 Difference]: With dead ends: 1455566 [2019-09-10 08:49:25,274 INFO L226 Difference]: Without dead ends: 1455566 [2019-09-10 08:49:25,274 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 08:49:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455566 states. [2019-09-10 08:50:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455566 to 1455412. [2019-09-10 08:50:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455412 states. [2019-09-10 08:50:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455412 states to 1455412 states and 2229377 transitions. [2019-09-10 08:50:26,045 INFO L78 Accepts]: Start accepts. Automaton has 1455412 states and 2229377 transitions. Word has length 326 [2019-09-10 08:50:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:26,045 INFO L475 AbstractCegarLoop]: Abstraction has 1455412 states and 2229377 transitions. [2019-09-10 08:50:26,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1455412 states and 2229377 transitions. [2019-09-10 08:50:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:50:26,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:26,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:26,420 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 289604605, now seen corresponding path program 1 times [2019-09-10 08:50:26,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:26,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:26,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:26,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:26,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:26,568 INFO L87 Difference]: Start difference. First operand 1455412 states and 2229377 transitions. Second operand 3 states. [2019-09-10 08:50:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:55,734 INFO L93 Difference]: Finished difference Result 2901642 states and 4444206 transitions. [2019-09-10 08:50:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:55,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:50:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:12,678 INFO L225 Difference]: With dead ends: 2901642 [2019-09-10 08:51:12,678 INFO L226 Difference]: Without dead ends: 2901642 [2019-09-10 08:51:12,679 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 08:51:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901642 states.