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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:55:53,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:55:53,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:55:53,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:55:53,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:55:53,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:55:53,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:55:53,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:55:53,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:55:53,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:55:53,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:55:53,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:55:53,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:55:53,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:55:53,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:55:53,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:55:53,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:55:53,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:55:53,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:55:53,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:55:53,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:55:53,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:55:53,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:55:53,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:55:53,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:55:53,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:55:53,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:55:53,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:55:53,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:55:53,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:55:53,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:55:53,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:55:53,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:55:53,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:55:53,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:55:53,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:55:53,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:55:53,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:55:53,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:55:53,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:55:53,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:55:53,283 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:55:53,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:55:53,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:55:53,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:55:53,310 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:55:53,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:55:53,311 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:55:53,312 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:55:53,312 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:55:53,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:55:53,312 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:55:53,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:55:53,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:55:53,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:55:53,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:55:53,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:55:53,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:55:53,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:55:53,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:55:53,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:55:53,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:55:53,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:55:53,317 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:55:53,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:55:53,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:55:53,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:55:53,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:55:53,318 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:55:53,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:55:53,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:55:53,319 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:55:53,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:55:53,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:55:53,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:55:53,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:55:53,373 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:55:53,373 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:55:53,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48d271a4/a21f6837b49c4082881ce2e138185b8f/FLAGa64d6cf5f [2019-09-10 08:55:54,190 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:55:54,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:55:54,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48d271a4/a21f6837b49c4082881ce2e138185b8f/FLAGa64d6cf5f [2019-09-10 08:55:54,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48d271a4/a21f6837b49c4082881ce2e138185b8f [2019-09-10 08:55:54,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:55:54,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:55:54,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:54,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:55:54,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:55:54,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:54" (1/1) ... [2019-09-10 08:55:54,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72769e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:54, skipping insertion in model container [2019-09-10 08:55:54,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:54" (1/1) ... [2019-09-10 08:55:54,331 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:55:54,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:55:55,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:55,961 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:55:57,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:57,333 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:55:57,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57 WrapperNode [2019-09-10 08:55:57,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:57,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:55:57,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:55:57,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:55:57,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... [2019-09-10 08:55:57,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:55:57,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:55:57,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:55:57,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:55:57,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:55:57,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:55:57,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:55:57,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:55:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:55:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:55:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:55:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:55:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:55:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:55:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:55:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:55:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:55:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:55:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:55:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:55:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:55:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:55:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:55:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:56:00,711 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:56:00,712 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:56:00,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:00 BoogieIcfgContainer [2019-09-10 08:56:00,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:56:00,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:56:00,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:56:00,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:56:00,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:55:54" (1/3) ... [2019-09-10 08:56:00,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259df852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:00, skipping insertion in model container [2019-09-10 08:56:00,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:57" (2/3) ... [2019-09-10 08:56:00,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259df852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:00, skipping insertion in model container [2019-09-10 08:56:00,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:00" (3/3) ... [2019-09-10 08:56:00,728 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:56:00,739 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:56:00,766 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 08:56:00,785 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 08:56:00,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:56:00,818 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:56:00,819 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:56:00,819 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:56:00,819 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:56:00,819 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:56:00,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:56:00,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:56:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states. [2019-09-10 08:56:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:56:00,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:00,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,930 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1793510694, now seen corresponding path program 1 times [2019-09-10 08:56:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:01,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:01,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:01,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:01,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:02,038 INFO 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:56:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:02,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:02,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:02,064 INFO L87 Difference]: Start difference. First operand 973 states. Second operand 3 states. [2019-09-10 08:56:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:02,448 INFO L93 Difference]: Finished difference Result 1415 states and 2501 transitions. [2019-09-10 08:56:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:02,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:56:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:02,485 INFO L225 Difference]: With dead ends: 1415 [2019-09-10 08:56:02,485 INFO L226 Difference]: Without dead ends: 1407 [2019-09-10 08:56:02,487 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:56:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-10 08:56:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1405. [2019-09-10 08:56:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-10 08:56:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2160 transitions. [2019-09-10 08:56:02,637 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2160 transitions. Word has length 314 [2019-09-10 08:56:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:02,642 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 2160 transitions. [2019-09-10 08:56:02,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2160 transitions. [2019-09-10 08:56:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:56:02,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:02,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,654 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -529611659, now seen corresponding path program 1 times [2019-09-10 08:56:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:02,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:03,104 INFO 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:56:03,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:03,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:03,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:03,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:03,110 INFO L87 Difference]: Start difference. First operand 1405 states and 2160 transitions. Second operand 3 states. [2019-09-10 08:56:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:03,409 INFO L93 Difference]: Finished difference Result 2301 states and 3556 transitions. [2019-09-10 08:56:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:03,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:56:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:03,426 INFO L225 Difference]: With dead ends: 2301 [2019-09-10 08:56:03,426 INFO L226 Difference]: Without dead ends: 2301 [2019-09-10 08:56:03,427 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:56:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2019-09-10 08:56:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2299. [2019-09-10 08:56:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-09-10 08:56:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3555 transitions. [2019-09-10 08:56:03,486 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3555 transitions. Word has length 314 [2019-09-10 08:56:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:03,487 INFO L475 AbstractCegarLoop]: Abstraction has 2299 states and 3555 transitions. [2019-09-10 08:56:03,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3555 transitions. [2019-09-10 08:56:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:56:03,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:03,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,497 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1390220078, now seen corresponding path program 1 times [2019-09-10 08:56:03,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:03,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:03,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:03,920 INFO 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:56:03,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:03,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:03,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:03,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:03,923 INFO L87 Difference]: Start difference. First operand 2299 states and 3555 transitions. Second operand 3 states. [2019-09-10 08:56:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:04,271 INFO L93 Difference]: Finished difference Result 4133 states and 6416 transitions. [2019-09-10 08:56:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:04,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:56:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:04,308 INFO L225 Difference]: With dead ends: 4133 [2019-09-10 08:56:04,309 INFO L226 Difference]: Without dead ends: 4133 [2019-09-10 08:56:04,309 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:56:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-09-10 08:56:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4131. [2019-09-10 08:56:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-09-10 08:56:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 6415 transitions. [2019-09-10 08:56:04,461 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 6415 transitions. Word has length 314 [2019-09-10 08:56:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:04,462 INFO L475 AbstractCegarLoop]: Abstraction has 4131 states and 6415 transitions. [2019-09-10 08:56:04,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 6415 transitions. [2019-09-10 08:56:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:56:04,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:04,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,477 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:04,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1390558702, now seen corresponding path program 1 times [2019-09-10 08:56:04,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:04,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:04,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:04,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:05,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:05,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:05,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:05,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:05,393 INFO L87 Difference]: Start difference. First operand 4131 states and 6415 transitions. Second operand 4 states. [2019-09-10 08:56:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:05,603 INFO L93 Difference]: Finished difference Result 8129 states and 12548 transitions. [2019-09-10 08:56:05,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:05,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 08:56:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:05,642 INFO L225 Difference]: With dead ends: 8129 [2019-09-10 08:56:05,643 INFO L226 Difference]: Without dead ends: 8129 [2019-09-10 08:56:05,643 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:56:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-09-10 08:56:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7930. [2019-09-10 08:56:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7930 states. [2019-09-10 08:56:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7930 states to 7930 states and 12283 transitions. [2019-09-10 08:56:05,875 INFO L78 Accepts]: Start accepts. Automaton has 7930 states and 12283 transitions. Word has length 314 [2019-09-10 08:56:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:05,876 INFO L475 AbstractCegarLoop]: Abstraction has 7930 states and 12283 transitions. [2019-09-10 08:56:05,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7930 states and 12283 transitions. [2019-09-10 08:56:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:56:05,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:05,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1931658382, now seen corresponding path program 1 times [2019-09-10 08:56:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:05,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:05,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:06,260 INFO 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:56:06,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:06,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:06,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:06,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:06,264 INFO L87 Difference]: Start difference. First operand 7930 states and 12283 transitions. Second operand 3 states. [2019-09-10 08:56:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:06,450 INFO L93 Difference]: Finished difference Result 15527 states and 23885 transitions. [2019-09-10 08:56:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:06,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 08:56:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:06,536 INFO L225 Difference]: With dead ends: 15527 [2019-09-10 08:56:06,536 INFO L226 Difference]: Without dead ends: 15527 [2019-09-10 08:56:06,537 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:56:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15527 states. [2019-09-10 08:56:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15527 to 15328. [2019-09-10 08:56:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-09-10 08:56:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 23620 transitions. [2019-09-10 08:56:07,074 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 23620 transitions. Word has length 316 [2019-09-10 08:56:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:07,075 INFO L475 AbstractCegarLoop]: Abstraction has 15328 states and 23620 transitions. [2019-09-10 08:56:07,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 23620 transitions. [2019-09-10 08:56:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:56:07,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:07,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,114 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 731103827, now seen corresponding path program 1 times [2019-09-10 08:56:07,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:07,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:07,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:07,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:07,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:07,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:56:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:07,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:07,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:07,306 INFO L87 Difference]: Start difference. First operand 15328 states and 23620 transitions. Second operand 3 states. [2019-09-10 08:56:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:07,479 INFO L93 Difference]: Finished difference Result 30623 states and 47180 transitions. [2019-09-10 08:56:07,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:07,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 08:56:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:07,554 INFO L225 Difference]: With dead ends: 30623 [2019-09-10 08:56:07,554 INFO L226 Difference]: Without dead ends: 30623 [2019-09-10 08:56:07,554 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:56:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30623 states. [2019-09-10 08:56:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30623 to 15347. [2019-09-10 08:56:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15347 states. [2019-09-10 08:56:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15347 states to 15347 states and 23648 transitions. [2019-09-10 08:56:08,713 INFO L78 Accepts]: Start accepts. Automaton has 15347 states and 23648 transitions. Word has length 316 [2019-09-10 08:56:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:08,714 INFO L475 AbstractCegarLoop]: Abstraction has 15347 states and 23648 transitions. [2019-09-10 08:56:08,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15347 states and 23648 transitions. [2019-09-10 08:56:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 08:56:08,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:08,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,744 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1542759636, now seen corresponding path program 1 times [2019-09-10 08:56:08,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:08,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:08,897 INFO 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:56:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:08,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:08,900 INFO L87 Difference]: Start difference. First operand 15347 states and 23648 transitions. Second operand 3 states. [2019-09-10 08:56:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:09,007 INFO L93 Difference]: Finished difference Result 30641 states and 47201 transitions. [2019-09-10 08:56:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 08:56:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:09,077 INFO L225 Difference]: With dead ends: 30641 [2019-09-10 08:56:09,078 INFO L226 Difference]: Without dead ends: 30641 [2019-09-10 08:56:09,078 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:56:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30641 states. [2019-09-10 08:56:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30641 to 15365. [2019-09-10 08:56:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15365 states. [2019-09-10 08:56:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 23669 transitions. [2019-09-10 08:56:09,430 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 23669 transitions. Word has length 317 [2019-09-10 08:56:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:09,431 INFO L475 AbstractCegarLoop]: Abstraction has 15365 states and 23669 transitions. [2019-09-10 08:56:09,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 23669 transitions. [2019-09-10 08:56:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:56:09,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:09,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,458 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -799652503, now seen corresponding path program 1 times [2019-09-10 08:56:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:09,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:09,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:09,906 INFO 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:56:09,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:09,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:09,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:09,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:09,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:09,909 INFO L87 Difference]: Start difference. First operand 15365 states and 23669 transitions. Second operand 3 states. [2019-09-10 08:56:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:10,066 INFO L93 Difference]: Finished difference Result 28315 states and 43255 transitions. [2019-09-10 08:56:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:10,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:56:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:10,130 INFO L225 Difference]: With dead ends: 28315 [2019-09-10 08:56:10,130 INFO L226 Difference]: Without dead ends: 28315 [2019-09-10 08:56:10,130 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:56:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28315 states. [2019-09-10 08:56:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28315 to 28116. [2019-09-10 08:56:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28116 states. [2019-09-10 08:56:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28116 states to 28116 states and 42990 transitions. [2019-09-10 08:56:10,596 INFO L78 Accepts]: Start accepts. Automaton has 28116 states and 42990 transitions. Word has length 318 [2019-09-10 08:56:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:10,597 INFO L475 AbstractCegarLoop]: Abstraction has 28116 states and 42990 transitions. [2019-09-10 08:56:10,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28116 states and 42990 transitions. [2019-09-10 08:56:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:56:10,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:10,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,667 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1480750214, now seen corresponding path program 1 times [2019-09-10 08:56:10,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:10,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:10,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:11,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:56:11,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:11,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:11,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:11,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:11,122 INFO L87 Difference]: Start difference. First operand 28116 states and 42990 transitions. Second operand 4 states. [2019-09-10 08:56:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:11,558 INFO L93 Difference]: Finished difference Result 54108 states and 82618 transitions. [2019-09-10 08:56:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:11,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 08:56:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:11,677 INFO L225 Difference]: With dead ends: 54108 [2019-09-10 08:56:11,678 INFO L226 Difference]: Without dead ends: 54108 [2019-09-10 08:56:11,679 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:56:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54108 states. [2019-09-10 08:56:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54108 to 28351. [2019-09-10 08:56:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28351 states. [2019-09-10 08:56:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28351 states to 28351 states and 43378 transitions. [2019-09-10 08:56:12,192 INFO L78 Accepts]: Start accepts. Automaton has 28351 states and 43378 transitions. Word has length 318 [2019-09-10 08:56:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:12,193 INFO L475 AbstractCegarLoop]: Abstraction has 28351 states and 43378 transitions. [2019-09-10 08:56:12,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 28351 states and 43378 transitions. [2019-09-10 08:56:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 08:56:12,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:12,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,241 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1111256138, now seen corresponding path program 1 times [2019-09-10 08:56:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:12,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:12,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:12,443 INFO 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:56:12,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:12,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:12,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:12,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:12,446 INFO L87 Difference]: Start difference. First operand 28351 states and 43378 transitions. Second operand 3 states. [2019-09-10 08:56:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:12,656 INFO L93 Difference]: Finished difference Result 40765 states and 63075 transitions. [2019-09-10 08:56:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:12,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-10 08:56:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:12,729 INFO L225 Difference]: With dead ends: 40765 [2019-09-10 08:56:12,729 INFO L226 Difference]: Without dead ends: 40765 [2019-09-10 08:56:12,732 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:56:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2019-09-10 08:56:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 35523. [2019-09-10 08:56:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35523 states. [2019-09-10 08:56:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35523 states to 35523 states and 55186 transitions. [2019-09-10 08:56:14,481 INFO L78 Accepts]: Start accepts. Automaton has 35523 states and 55186 transitions. Word has length 319 [2019-09-10 08:56:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:14,482 INFO L475 AbstractCegarLoop]: Abstraction has 35523 states and 55186 transitions. [2019-09-10 08:56:14,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 35523 states and 55186 transitions. [2019-09-10 08:56:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:56:14,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:14,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,511 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash -498443357, now seen corresponding path program 1 times [2019-09-10 08:56:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:14,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:14,675 INFO 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:56:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:14,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:14,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:14,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:14,677 INFO L87 Difference]: Start difference. First operand 35523 states and 55186 transitions. Second operand 3 states. [2019-09-10 08:56:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:14,897 INFO L93 Difference]: Finished difference Result 70279 states and 109016 transitions. [2019-09-10 08:56:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:14,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:56:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:15,007 INFO L225 Difference]: With dead ends: 70279 [2019-09-10 08:56:15,007 INFO L226 Difference]: Without dead ends: 70279 [2019-09-10 08:56:15,008 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:56:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70279 states. [2019-09-10 08:56:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70279 to 35627. [2019-09-10 08:56:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35627 states. [2019-09-10 08:56:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35627 states to 35627 states and 55329 transitions. [2019-09-10 08:56:15,834 INFO L78 Accepts]: Start accepts. Automaton has 35627 states and 55329 transitions. Word has length 320 [2019-09-10 08:56:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:15,835 INFO L475 AbstractCegarLoop]: Abstraction has 35627 states and 55329 transitions. [2019-09-10 08:56:15,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 35627 states and 55329 transitions. [2019-09-10 08:56:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:56:15,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:15,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:15,862 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -623768252, now seen corresponding path program 1 times [2019-09-10 08:56:15,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:15,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:15,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:15,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:16,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:16,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:16,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:16,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:16,192 INFO L87 Difference]: Start difference. First operand 35627 states and 55329 transitions. Second operand 3 states. [2019-09-10 08:56:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:16,413 INFO L93 Difference]: Finished difference Result 70404 states and 109162 transitions. [2019-09-10 08:56:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:16,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 08:56:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:16,515 INFO L225 Difference]: With dead ends: 70404 [2019-09-10 08:56:16,515 INFO L226 Difference]: Without dead ends: 70404 [2019-09-10 08:56:16,515 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:56:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70404 states. [2019-09-10 08:56:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70404 to 35752. [2019-09-10 08:56:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35752 states. [2019-09-10 08:56:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35752 states to 35752 states and 55475 transitions. [2019-09-10 08:56:17,140 INFO L78 Accepts]: Start accepts. Automaton has 35752 states and 55475 transitions. Word has length 321 [2019-09-10 08:56:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:17,140 INFO L475 AbstractCegarLoop]: Abstraction has 35752 states and 55475 transitions. [2019-09-10 08:56:17,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 35752 states and 55475 transitions. [2019-09-10 08:56:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:56:17,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:17,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,165 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:17,166 INFO L82 PathProgramCache]: Analyzing trace with hash 917262259, now seen corresponding path program 1 times [2019-09-10 08:56:17,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:17,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:17,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:17,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:56:17,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:17,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:56:17,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:17,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:56:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:56:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:17,568 INFO L87 Difference]: Start difference. First operand 35752 states and 55475 transitions. Second operand 5 states. [2019-09-10 08:56:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:18,537 INFO L93 Difference]: Finished difference Result 65970 states and 102060 transitions. [2019-09-10 08:56:18,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:56:18,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-09-10 08:56:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:18,625 INFO L225 Difference]: With dead ends: 65970 [2019-09-10 08:56:18,626 INFO L226 Difference]: Without dead ends: 65970 [2019-09-10 08:56:18,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:56:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65970 states. [2019-09-10 08:56:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65970 to 65968. [2019-09-10 08:56:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65968 states. [2019-09-10 08:56:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65968 states to 65968 states and 102059 transitions. [2019-09-10 08:56:19,502 INFO L78 Accepts]: Start accepts. Automaton has 65968 states and 102059 transitions. Word has length 322 [2019-09-10 08:56:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:19,503 INFO L475 AbstractCegarLoop]: Abstraction has 65968 states and 102059 transitions. [2019-09-10 08:56:19,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:56:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65968 states and 102059 transitions. [2019-09-10 08:56:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:56:19,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:19,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,546 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1932771416, now seen corresponding path program 1 times [2019-09-10 08:56:19,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:19,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:19,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:19,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:20,204 INFO 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:56:20,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:20,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:20,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:20,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:20,207 INFO L87 Difference]: Start difference. First operand 65968 states and 102059 transitions. Second operand 4 states. [2019-09-10 08:56:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:20,673 INFO L93 Difference]: Finished difference Result 129539 states and 199343 transitions. [2019-09-10 08:56:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:20,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 08:56:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:20,821 INFO L225 Difference]: With dead ends: 129539 [2019-09-10 08:56:20,822 INFO L226 Difference]: Without dead ends: 129539 [2019-09-10 08:56:20,822 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:56:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129539 states. [2019-09-10 08:56:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129539 to 129364. [2019-09-10 08:56:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129364 states. [2019-09-10 08:56:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129364 states to 129364 states and 199110 transitions. [2019-09-10 08:56:22,689 INFO L78 Accepts]: Start accepts. Automaton has 129364 states and 199110 transitions. Word has length 322 [2019-09-10 08:56:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:22,690 INFO L475 AbstractCegarLoop]: Abstraction has 129364 states and 199110 transitions. [2019-09-10 08:56:22,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 129364 states and 199110 transitions. [2019-09-10 08:56:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:56:22,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:22,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,755 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1561766959, now seen corresponding path program 1 times [2019-09-10 08:56:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:22,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:25,282 INFO 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:56:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:25,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:25,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:25,284 INFO L87 Difference]: Start difference. First operand 129364 states and 199110 transitions. Second operand 3 states. [2019-09-10 08:56:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:25,914 INFO L93 Difference]: Finished difference Result 252227 states and 385298 transitions. [2019-09-10 08:56:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:25,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:56:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:26,211 INFO L225 Difference]: With dead ends: 252227 [2019-09-10 08:56:26,211 INFO L226 Difference]: Without dead ends: 252227 [2019-09-10 08:56:26,212 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:56:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252227 states. [2019-09-10 08:56:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252227 to 252060. [2019-09-10 08:56:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252060 states. [2019-09-10 08:56:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252060 states to 252060 states and 385081 transitions. [2019-09-10 08:56:29,563 INFO L78 Accepts]: Start accepts. Automaton has 252060 states and 385081 transitions. Word has length 324 [2019-09-10 08:56:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:29,563 INFO L475 AbstractCegarLoop]: Abstraction has 252060 states and 385081 transitions. [2019-09-10 08:56:29,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 252060 states and 385081 transitions. [2019-09-10 08:56:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:56:33,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:33,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,480 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1252289030, now seen corresponding path program 1 times [2019-09-10 08:56:33,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:33,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:33,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:33,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:33,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:33,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:33,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:33,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:33,774 INFO L87 Difference]: Start difference. First operand 252060 states and 385081 transitions. Second operand 3 states. [2019-09-10 08:56:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:35,025 INFO L93 Difference]: Finished difference Result 463387 states and 701799 transitions. [2019-09-10 08:56:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:35,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:56:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:35,591 INFO L225 Difference]: With dead ends: 463387 [2019-09-10 08:56:35,592 INFO L226 Difference]: Without dead ends: 463387 [2019-09-10 08:56:35,592 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:56:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463387 states. [2019-09-10 08:56:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463387 to 463228. [2019-09-10 08:56:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463228 states. [2019-09-10 08:56:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463228 states to 463228 states and 701598 transitions. [2019-09-10 08:56:45,834 INFO L78 Accepts]: Start accepts. Automaton has 463228 states and 701598 transitions. Word has length 324 [2019-09-10 08:56:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:45,834 INFO L475 AbstractCegarLoop]: Abstraction has 463228 states and 701598 transitions. [2019-09-10 08:56:45,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 463228 states and 701598 transitions. [2019-09-10 08:56:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:56:46,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:46,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,100 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2008988189, now seen corresponding path program 1 times [2019-09-10 08:56:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:46,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:52,858 INFO 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:56:52,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:52,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:52,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:52,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:52,862 INFO L87 Difference]: Start difference. First operand 463228 states and 701598 transitions. Second operand 4 states. [2019-09-10 08:56:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:55,104 INFO L93 Difference]: Finished difference Result 867087 states and 1312193 transitions. [2019-09-10 08:56:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:55,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:56:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:57,661 INFO L225 Difference]: With dead ends: 867087 [2019-09-10 08:56:57,662 INFO L226 Difference]: Without dead ends: 867087 [2019-09-10 08:56:57,662 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:56:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867087 states. [2019-09-10 08:57:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867087 to 463850. [2019-09-10 08:57:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463850 states. [2019-09-10 08:57:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463850 states to 463850 states and 702588 transitions. [2019-09-10 08:57:16,994 INFO L78 Accepts]: Start accepts. Automaton has 463850 states and 702588 transitions. Word has length 324 [2019-09-10 08:57:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:16,994 INFO L475 AbstractCegarLoop]: Abstraction has 463850 states and 702588 transitions. [2019-09-10 08:57:16,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 463850 states and 702588 transitions. [2019-09-10 08:57:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:57:17,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:17,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:17,227 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 238219988, now seen corresponding path program 1 times [2019-09-10 08:57:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:17,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:17,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:17,666 INFO 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:57:17,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:17,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:17,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:17,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:17,668 INFO L87 Difference]: Start difference. First operand 463850 states and 702588 transitions. Second operand 4 states. [2019-09-10 08:57:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:24,888 INFO L93 Difference]: Finished difference Result 428985 states and 649515 transitions. [2019-09-10 08:57:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:24,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 08:57:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:26,029 INFO L225 Difference]: With dead ends: 428985 [2019-09-10 08:57:26,029 INFO L226 Difference]: Without dead ends: 423553 [2019-09-10 08:57:26,030 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:57:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423553 states. [2019-09-10 08:57:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423553 to 422945. [2019-09-10 08:57:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422945 states. [2019-09-10 08:57:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422945 states to 422945 states and 640268 transitions. [2019-09-10 08:57:31,304 INFO L78 Accepts]: Start accepts. Automaton has 422945 states and 640268 transitions. Word has length 326 [2019-09-10 08:57:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:31,304 INFO L475 AbstractCegarLoop]: Abstraction has 422945 states and 640268 transitions. [2019-09-10 08:57:31,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 422945 states and 640268 transitions. [2019-09-10 08:57:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:57:32,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:32,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:32,753 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash 361274255, now seen corresponding path program 1 times [2019-09-10 08:57:32,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:32,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:32,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:32,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:32,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:33,214 INFO 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:57:33,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:33,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:57:33,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:33,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:57:33,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:57:33,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:57:33,219 INFO L87 Difference]: Start difference. First operand 422945 states and 640268 transitions. Second operand 8 states. [2019-09-10 08:57:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:38,836 INFO L93 Difference]: Finished difference Result 960878 states and 1464220 transitions. [2019-09-10 08:57:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:57:38,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-09-10 08:57:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:50,175 INFO L225 Difference]: With dead ends: 960878 [2019-09-10 08:57:50,175 INFO L226 Difference]: Without dead ends: 960878 [2019-09-10 08:57:50,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:57:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960878 states. [2019-09-10 08:57:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960878 to 578469. [2019-09-10 08:57:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578469 states. [2019-09-10 08:58:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578469 states to 578469 states and 867113 transitions. [2019-09-10 08:58:00,647 INFO L78 Accepts]: Start accepts. Automaton has 578469 states and 867113 transitions. Word has length 330 [2019-09-10 08:58:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:00,648 INFO L475 AbstractCegarLoop]: Abstraction has 578469 states and 867113 transitions. [2019-09-10 08:58:00,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:58:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 578469 states and 867113 transitions. [2019-09-10 08:58:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:58:00,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:00,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:00,975 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:00,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1161533927, now seen corresponding path program 1 times [2019-09-10 08:58:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:00,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:00,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:08,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:08,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:58:08,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:08,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:58:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:58:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:58:08,644 INFO L87 Difference]: Start difference. First operand 578469 states and 867113 transitions. Second operand 4 states. [2019-09-10 08:58:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:12,493 INFO L93 Difference]: Finished difference Result 1107045 states and 1649640 transitions. [2019-09-10 08:58:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:12,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 08:58:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:14,084 INFO L225 Difference]: With dead ends: 1107045 [2019-09-10 08:58:14,084 INFO L226 Difference]: Without dead ends: 1107045 [2019-09-10 08:58:14,085 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:58:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107045 states. [2019-09-10 08:58:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107045 to 1106934. [2019-09-10 08:58:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106934 states. [2019-09-10 08:58:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106934 states to 1106934 states and 1649505 transitions. [2019-09-10 08:58:53,115 INFO L78 Accepts]: Start accepts. Automaton has 1106934 states and 1649505 transitions. Word has length 330 [2019-09-10 08:58:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:53,115 INFO L475 AbstractCegarLoop]: Abstraction has 1106934 states and 1649505 transitions. [2019-09-10 08:58:53,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1106934 states and 1649505 transitions. [2019-09-10 08:58:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:58:53,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:53,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:53,664 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1732088541, now seen corresponding path program 1 times [2019-09-10 08:58:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:53,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:53,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:54,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:54,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:54,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:54,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:54,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:54,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:54,005 INFO L87 Difference]: Start difference. First operand 1106934 states and 1649505 transitions. Second operand 3 states. [2019-09-10 08:59:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:14,671 INFO L93 Difference]: Finished difference Result 2148289 states and 3171444 transitions. [2019-09-10 08:59:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:14,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:59:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:19,838 INFO L225 Difference]: With dead ends: 2148289 [2019-09-10 08:59:19,838 INFO L226 Difference]: Without dead ends: 2148289 [2019-09-10 08:59:19,838 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:59:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148289 states.