java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:21:20,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:21:20,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:21:20,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:21:20,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:21:20,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:21:20,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:21:20,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:21:20,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:21:20,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:21:20,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:21:20,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:21:20,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:21:20,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:21:20,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:21:20,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:21:20,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:21:20,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:21:20,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:21:20,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:21:20,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:21:20,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:21:20,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:21:20,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:21:20,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:21:20,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:21:20,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:21:20,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:21:20,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:21:20,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:21:20,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:21:20,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:21:20,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:21:20,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:21:20,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:21:20,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:21:20,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:21:20,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:21:20,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:21:20,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:21:20,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:21:20,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:21:20,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:21:20,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:21:20,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:21:20,353 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:21:20,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:21:20,354 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:21:20,354 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:21:20,355 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:21:20,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:21:20,355 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:21:20,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:21:20,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:21:20,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:21:20,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:21:20,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:21:20,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:21:20,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:21:20,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:21:20,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:21:20,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:21:20,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:21:20,358 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:21:20,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:21:20,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:21:20,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:21:20,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:21:20,359 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:21:20,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:21:20,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:21:20,359 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:21:20,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:21:20,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:21:20,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:21:20,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:21:20,408 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:21:20,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:21:20,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3208acc11/1c838e4b8831408da84d0b764ca2731d/FLAG43446bdac [2019-09-10 06:21:21,109 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:21:21,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:21:21,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3208acc11/1c838e4b8831408da84d0b764ca2731d/FLAG43446bdac [2019-09-10 06:21:21,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3208acc11/1c838e4b8831408da84d0b764ca2731d [2019-09-10 06:21:21,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:21:21,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:21:21,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:21,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:21:21,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:21:21,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:21" (1/1) ... [2019-09-10 06:21:21,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:21, skipping insertion in model container [2019-09-10 06:21:21,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:21" (1/1) ... [2019-09-10 06:21:21,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:21:21,428 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:21:22,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:22,650 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:21:23,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:23,573 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:21:23,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23 WrapperNode [2019-09-10 06:21:23,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:23,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:21:23,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:21:23,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:21:23,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... [2019-09-10 06:21:23,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:21:23,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:21:23,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:21:23,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:21:23,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:21:23,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:21:23,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:21:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:21:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:21:23,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:21:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:21:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:21:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:21:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:21:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:21:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:21:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:21:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:21:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:21:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:21:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:21:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:21:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:21:26,836 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:21:26,837 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:21:26,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:26 BoogieIcfgContainer [2019-09-10 06:21:26,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:21:26,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:21:26,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:21:26,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:21:26,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:21:21" (1/3) ... [2019-09-10 06:21:26,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752271ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:26, skipping insertion in model container [2019-09-10 06:21:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:23" (2/3) ... [2019-09-10 06:21:26,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752271ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:26, skipping insertion in model container [2019-09-10 06:21:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:26" (3/3) ... [2019-09-10 06:21:26,847 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:21:26,857 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:21:26,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:21:26,889 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:21:26,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:21:26,922 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:21:26,922 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:21:26,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:21:26,922 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:21:26,923 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:21:26,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:21:26,924 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:21:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states. [2019-09-10 06:21:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:21:27,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:27,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:27,017 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -793306270, now seen corresponding path program 1 times [2019-09-10 06:21:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:27,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:28,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:28,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:28,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:28,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:28,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:28,140 INFO L87 Difference]: Start difference. First operand 910 states. Second operand 3 states. [2019-09-10 06:21:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:28,457 INFO L93 Difference]: Finished difference Result 1308 states and 2321 transitions. [2019-09-10 06:21:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:28,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:21:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:28,486 INFO L225 Difference]: With dead ends: 1308 [2019-09-10 06:21:28,486 INFO L226 Difference]: Without dead ends: 1300 [2019-09-10 06:21:28,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-09-10 06:21:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1298. [2019-09-10 06:21:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-09-10 06:21:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1986 transitions. [2019-09-10 06:21:28,614 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1986 transitions. Word has length 302 [2019-09-10 06:21:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:28,615 INFO L475 AbstractCegarLoop]: Abstraction has 1298 states and 1986 transitions. [2019-09-10 06:21:28,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1986 transitions. [2019-09-10 06:21:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:21:28,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:28,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:28,625 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1622135027, now seen corresponding path program 1 times [2019-09-10 06:21:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:28,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:29,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:29,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:29,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:29,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:29,207 INFO L87 Difference]: Start difference. First operand 1298 states and 1986 transitions. Second operand 3 states. [2019-09-10 06:21:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:29,519 INFO L93 Difference]: Finished difference Result 2162 states and 3329 transitions. [2019-09-10 06:21:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:29,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:21:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:29,535 INFO L225 Difference]: With dead ends: 2162 [2019-09-10 06:21:29,535 INFO L226 Difference]: Without dead ends: 2162 [2019-09-10 06:21:29,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 06:21:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2019-09-10 06:21:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2160. [2019-09-10 06:21:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-09-10 06:21:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 3328 transitions. [2019-09-10 06:21:29,605 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 3328 transitions. Word has length 302 [2019-09-10 06:21:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:29,606 INFO L475 AbstractCegarLoop]: Abstraction has 2160 states and 3328 transitions. [2019-09-10 06:21:29,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 3328 transitions. [2019-09-10 06:21:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:21:29,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:29,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:29,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1621796403, now seen corresponding path program 1 times [2019-09-10 06:21:29,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:29,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:30,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:30,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:30,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:30,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:30,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:30,695 INFO L87 Difference]: Start difference. First operand 2160 states and 3328 transitions. Second operand 4 states. [2019-09-10 06:21:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:30,869 INFO L93 Difference]: Finished difference Result 4241 states and 6497 transitions. [2019-09-10 06:21:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:30,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:21:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:30,890 INFO L225 Difference]: With dead ends: 4241 [2019-09-10 06:21:30,891 INFO L226 Difference]: Without dead ends: 4241 [2019-09-10 06:21:30,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2019-09-10 06:21:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 4099. [2019-09-10 06:21:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2019-09-10 06:21:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 6301 transitions. [2019-09-10 06:21:30,995 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 6301 transitions. Word has length 302 [2019-09-10 06:21:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:30,996 INFO L475 AbstractCegarLoop]: Abstraction has 4099 states and 6301 transitions. [2019-09-10 06:21:30,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 6301 transitions. [2019-09-10 06:21:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:21:31,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:31,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:31,009 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash 293737729, now seen corresponding path program 1 times [2019-09-10 06:21:31,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:31,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:31,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:31,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:31,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:31,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:31,399 INFO L87 Difference]: Start difference. First operand 4099 states and 6301 transitions. Second operand 3 states. [2019-09-10 06:21:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:31,548 INFO L93 Difference]: Finished difference Result 8052 states and 12310 transitions. [2019-09-10 06:21:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:31,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:21:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:31,586 INFO L225 Difference]: With dead ends: 8052 [2019-09-10 06:21:31,586 INFO L226 Difference]: Without dead ends: 8052 [2019-09-10 06:21:31,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8052 states. [2019-09-10 06:21:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8052 to 7910. [2019-09-10 06:21:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2019-09-10 06:21:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 12114 transitions. [2019-09-10 06:21:31,761 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 12114 transitions. Word has length 304 [2019-09-10 06:21:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:31,761 INFO L475 AbstractCegarLoop]: Abstraction has 7910 states and 12114 transitions. [2019-09-10 06:21:31,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 12114 transitions. [2019-09-10 06:21:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:21:31,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:31,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:31,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash -380251578, now seen corresponding path program 1 times [2019-09-10 06:21:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:31,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:31,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:31,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:31,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:31,998 INFO L87 Difference]: Start difference. First operand 7910 states and 12114 transitions. Second operand 3 states. [2019-09-10 06:21:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:32,162 INFO L93 Difference]: Finished difference Result 15787 states and 24168 transitions. [2019-09-10 06:21:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:32,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:21:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:32,242 INFO L225 Difference]: With dead ends: 15787 [2019-09-10 06:21:32,242 INFO L226 Difference]: Without dead ends: 15787 [2019-09-10 06:21:32,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15787 states. [2019-09-10 06:21:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15787 to 7929. [2019-09-10 06:21:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7929 states. [2019-09-10 06:21:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7929 states to 7929 states and 12142 transitions. [2019-09-10 06:21:32,508 INFO L78 Accepts]: Start accepts. Automaton has 7929 states and 12142 transitions. Word has length 304 [2019-09-10 06:21:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:32,509 INFO L475 AbstractCegarLoop]: Abstraction has 7929 states and 12142 transitions. [2019-09-10 06:21:32,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7929 states and 12142 transitions. [2019-09-10 06:21:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-10 06:21:32,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:32,532 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] [2019-09-10 06:21:32,533 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1967466857, now seen corresponding path program 1 times [2019-09-10 06:21:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:32,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:32,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:32,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:32,695 INFO L87 Difference]: Start difference. First operand 7929 states and 12142 transitions. Second operand 3 states. [2019-09-10 06:21:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:32,793 INFO L93 Difference]: Finished difference Result 15805 states and 24189 transitions. [2019-09-10 06:21:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:32,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-10 06:21:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:32,828 INFO L225 Difference]: With dead ends: 15805 [2019-09-10 06:21:32,829 INFO L226 Difference]: Without dead ends: 15805 [2019-09-10 06:21:32,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15805 states. [2019-09-10 06:21:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15805 to 7947. [2019-09-10 06:21:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7947 states. [2019-09-10 06:21:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7947 states to 7947 states and 12163 transitions. [2019-09-10 06:21:33,029 INFO L78 Accepts]: Start accepts. Automaton has 7947 states and 12163 transitions. Word has length 305 [2019-09-10 06:21:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:33,030 INFO L475 AbstractCegarLoop]: Abstraction has 7947 states and 12163 transitions. [2019-09-10 06:21:33,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 12163 transitions. [2019-09-10 06:21:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:21:33,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:33,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:33,050 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1319362460, now seen corresponding path program 1 times [2019-09-10 06:21:33,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:33,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:33,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:33,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:33,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:33,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:33,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:33,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:33,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:33,403 INFO L87 Difference]: Start difference. First operand 7947 states and 12163 transitions. Second operand 3 states. [2019-09-10 06:21:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:33,550 INFO L93 Difference]: Finished difference Result 15512 states and 23587 transitions. [2019-09-10 06:21:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:33,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:21:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:33,587 INFO L225 Difference]: With dead ends: 15512 [2019-09-10 06:21:33,588 INFO L226 Difference]: Without dead ends: 15512 [2019-09-10 06:21:33,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15512 states. [2019-09-10 06:21:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15512 to 15370. [2019-09-10 06:21:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15370 states. [2019-09-10 06:21:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15370 states to 15370 states and 23391 transitions. [2019-09-10 06:21:33,864 INFO L78 Accepts]: Start accepts. Automaton has 15370 states and 23391 transitions. Word has length 306 [2019-09-10 06:21:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:33,864 INFO L475 AbstractCegarLoop]: Abstraction has 15370 states and 23391 transitions. [2019-09-10 06:21:33,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15370 states and 23391 transitions. [2019-09-10 06:21:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:21:33,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:33,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:33,898 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash 183505465, now seen corresponding path program 1 times [2019-09-10 06:21:33,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:33,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:33,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:33,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:34,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:34,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:34,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:34,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:34,423 INFO L87 Difference]: Start difference. First operand 15370 states and 23391 transitions. Second operand 4 states. [2019-09-10 06:21:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:34,575 INFO L93 Difference]: Finished difference Result 28628 states and 43443 transitions. [2019-09-10 06:21:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:34,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:21:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:34,644 INFO L225 Difference]: With dead ends: 28628 [2019-09-10 06:21:34,644 INFO L226 Difference]: Without dead ends: 28628 [2019-09-10 06:21:34,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28628 states. [2019-09-10 06:21:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28628 to 15605. [2019-09-10 06:21:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-09-10 06:21:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 23779 transitions. [2019-09-10 06:21:34,971 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 23779 transitions. Word has length 306 [2019-09-10 06:21:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:34,971 INFO L475 AbstractCegarLoop]: Abstraction has 15605 states and 23779 transitions. [2019-09-10 06:21:34,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 23779 transitions. [2019-09-10 06:21:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:35,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:35,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:35,002 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1255917736, now seen corresponding path program 1 times [2019-09-10 06:21:35,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:35,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:35,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:35,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:35,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:35,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:35,164 INFO L87 Difference]: Start difference. First operand 15605 states and 23779 transitions. Second operand 3 states. [2019-09-10 06:21:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:35,274 INFO L93 Difference]: Finished difference Result 30443 states and 46202 transitions. [2019-09-10 06:21:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:35,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:21:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:35,313 INFO L225 Difference]: With dead ends: 30443 [2019-09-10 06:21:35,313 INFO L226 Difference]: Without dead ends: 30443 [2019-09-10 06:21:35,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30443 states. [2019-09-10 06:21:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30443 to 15709. [2019-09-10 06:21:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15709 states. [2019-09-10 06:21:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 23922 transitions. [2019-09-10 06:21:35,733 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 23922 transitions. Word has length 308 [2019-09-10 06:21:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:35,734 INFO L475 AbstractCegarLoop]: Abstraction has 15709 states and 23922 transitions. [2019-09-10 06:21:35,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 23922 transitions. [2019-09-10 06:21:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-10 06:21:35,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:35,757 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] [2019-09-10 06:21:35,758 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1180134737, now seen corresponding path program 1 times [2019-09-10 06:21:35,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:35,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:35,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:35,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:35,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:35,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:35,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:35,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:35,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:35,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:35,935 INFO L87 Difference]: Start difference. First operand 15709 states and 23922 transitions. Second operand 3 states. [2019-09-10 06:21:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:36,060 INFO L93 Difference]: Finished difference Result 30568 states and 46348 transitions. [2019-09-10 06:21:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:36,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-10 06:21:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:36,104 INFO L225 Difference]: With dead ends: 30568 [2019-09-10 06:21:36,104 INFO L226 Difference]: Without dead ends: 30568 [2019-09-10 06:21:36,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30568 states. [2019-09-10 06:21:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30568 to 15834. [2019-09-10 06:21:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15834 states. [2019-09-10 06:21:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15834 states to 15834 states and 24068 transitions. [2019-09-10 06:21:36,409 INFO L78 Accepts]: Start accepts. Automaton has 15834 states and 24068 transitions. Word has length 309 [2019-09-10 06:21:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:36,409 INFO L475 AbstractCegarLoop]: Abstraction has 15834 states and 24068 transitions. [2019-09-10 06:21:36,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 15834 states and 24068 transitions. [2019-09-10 06:21:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:21:36,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:36,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:36,423 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1030476261, now seen corresponding path program 1 times [2019-09-10 06:21:36,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:36,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:36,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:36,810 INFO L87 Difference]: Start difference. First operand 15834 states and 24068 transitions. Second operand 4 states. [2019-09-10 06:21:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:36,895 INFO L93 Difference]: Finished difference Result 14768 states and 22468 transitions. [2019-09-10 06:21:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:36,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-10 06:21:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:37,538 INFO L225 Difference]: With dead ends: 14768 [2019-09-10 06:21:37,538 INFO L226 Difference]: Without dead ends: 13971 [2019-09-10 06:21:37,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13971 states. [2019-09-10 06:21:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13971 to 13951. [2019-09-10 06:21:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13951 states. [2019-09-10 06:21:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13951 states to 13951 states and 21201 transitions. [2019-09-10 06:21:37,693 INFO L78 Accepts]: Start accepts. Automaton has 13951 states and 21201 transitions. Word has length 310 [2019-09-10 06:21:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:37,693 INFO L475 AbstractCegarLoop]: Abstraction has 13951 states and 21201 transitions. [2019-09-10 06:21:37,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13951 states and 21201 transitions. [2019-09-10 06:21:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:21:37,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:37,706 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 06:21:37,707 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -293944310, now seen corresponding path program 1 times [2019-09-10 06:21:37,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:37,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:37,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:37,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:21:38,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:21:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:21:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:21:38,274 INFO L87 Difference]: Start difference. First operand 13951 states and 21201 transitions. Second operand 9 states. [2019-09-10 06:21:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:38,935 INFO L93 Difference]: Finished difference Result 24167 states and 36550 transitions. [2019-09-10 06:21:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:38,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-10 06:21:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:38,981 INFO L225 Difference]: With dead ends: 24167 [2019-09-10 06:21:38,981 INFO L226 Difference]: Without dead ends: 24167 [2019-09-10 06:21:38,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:21:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24167 states. [2019-09-10 06:21:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24167 to 24165. [2019-09-10 06:21:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24165 states. [2019-09-10 06:21:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24165 states to 24165 states and 36549 transitions. [2019-09-10 06:21:39,269 INFO L78 Accepts]: Start accepts. Automaton has 24165 states and 36549 transitions. Word has length 314 [2019-09-10 06:21:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:39,270 INFO L475 AbstractCegarLoop]: Abstraction has 24165 states and 36549 transitions. [2019-09-10 06:21:39,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:21:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24165 states and 36549 transitions. [2019-09-10 06:21:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:21:39,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:39,291 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 06:21:39,291 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 451007038, now seen corresponding path program 1 times [2019-09-10 06:21:39,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:39,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:39,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:40,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:40,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:21:40,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:40,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:21:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:21:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:21:40,439 INFO L87 Difference]: Start difference. First operand 24165 states and 36549 transitions. Second operand 17 states. [2019-09-10 06:21:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:44,914 INFO L93 Difference]: Finished difference Result 40622 states and 61939 transitions. [2019-09-10 06:21:44,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:21:44,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 314 [2019-09-10 06:21:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:44,972 INFO L225 Difference]: With dead ends: 40622 [2019-09-10 06:21:44,972 INFO L226 Difference]: Without dead ends: 40622 [2019-09-10 06:21:44,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:21:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40622 states. [2019-09-10 06:21:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40622 to 26521. [2019-09-10 06:21:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26521 states. [2019-09-10 06:21:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26521 states to 26521 states and 39893 transitions. [2019-09-10 06:21:45,396 INFO L78 Accepts]: Start accepts. Automaton has 26521 states and 39893 transitions. Word has length 314 [2019-09-10 06:21:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:45,397 INFO L475 AbstractCegarLoop]: Abstraction has 26521 states and 39893 transitions. [2019-09-10 06:21:45,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:21:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26521 states and 39893 transitions. [2019-09-10 06:21:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:21:45,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:45,424 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 06:21:45,425 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -126096328, now seen corresponding path program 1 times [2019-09-10 06:21:45,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:45,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:45,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:45,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:45,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:45,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:45,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:45,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:45,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:45,950 INFO L87 Difference]: Start difference. First operand 26521 states and 39893 transitions. Second operand 4 states. [2019-09-10 06:21:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:46,234 INFO L93 Difference]: Finished difference Result 51756 states and 77271 transitions. [2019-09-10 06:21:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:46,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:21:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:46,328 INFO L225 Difference]: With dead ends: 51756 [2019-09-10 06:21:46,329 INFO L226 Difference]: Without dead ends: 51756 [2019-09-10 06:21:46,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51756 states. [2019-09-10 06:21:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51756 to 51620. [2019-09-10 06:21:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51620 states. [2019-09-10 06:21:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51620 states to 51620 states and 77085 transitions. [2019-09-10 06:21:47,276 INFO L78 Accepts]: Start accepts. Automaton has 51620 states and 77085 transitions. Word has length 314 [2019-09-10 06:21:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:47,277 INFO L475 AbstractCegarLoop]: Abstraction has 51620 states and 77085 transitions. [2019-09-10 06:21:47,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51620 states and 77085 transitions. [2019-09-10 06:21:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:21:47,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:47,324 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 06:21:47,325 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1746697347, now seen corresponding path program 1 times [2019-09-10 06:21:47,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:47,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:47,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:47,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:47,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:47,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:47,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:47,562 INFO L87 Difference]: Start difference. First operand 51620 states and 77085 transitions. Second operand 3 states. [2019-09-10 06:21:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:47,939 INFO L93 Difference]: Finished difference Result 100719 states and 149237 transitions. [2019-09-10 06:21:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:47,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:21:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:48,089 INFO L225 Difference]: With dead ends: 100719 [2019-09-10 06:21:48,089 INFO L226 Difference]: Without dead ends: 100719 [2019-09-10 06:21:48,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100719 states. [2019-09-10 06:21:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100719 to 100587. [2019-09-10 06:21:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100587 states. [2019-09-10 06:21:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100587 states to 100587 states and 149059 transitions. [2019-09-10 06:21:50,908 INFO L78 Accepts]: Start accepts. Automaton has 100587 states and 149059 transitions. Word has length 316 [2019-09-10 06:21:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:50,909 INFO L475 AbstractCegarLoop]: Abstraction has 100587 states and 149059 transitions. [2019-09-10 06:21:50,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 100587 states and 149059 transitions. [2019-09-10 06:21:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:21:50,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:50,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:50,987 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -694608418, now seen corresponding path program 1 times [2019-09-10 06:21:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:50,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:51,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:51,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:51,268 INFO L87 Difference]: Start difference. First operand 100587 states and 149059 transitions. Second operand 3 states. [2019-09-10 06:21:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:52,016 INFO L93 Difference]: Finished difference Result 196874 states and 289576 transitions. [2019-09-10 06:21:52,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:52,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 06:21:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:52,303 INFO L225 Difference]: With dead ends: 196874 [2019-09-10 06:21:52,303 INFO L226 Difference]: Without dead ends: 196874 [2019-09-10 06:21:52,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196874 states. [2019-09-10 06:21:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196874 to 196746. [2019-09-10 06:21:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196746 states. [2019-09-10 06:21:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196746 states to 196746 states and 289406 transitions. [2019-09-10 06:21:56,709 INFO L78 Accepts]: Start accepts. Automaton has 196746 states and 289406 transitions. Word has length 318 [2019-09-10 06:21:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:56,709 INFO L475 AbstractCegarLoop]: Abstraction has 196746 states and 289406 transitions. [2019-09-10 06:21:56,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 196746 states and 289406 transitions. [2019-09-10 06:21:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:21:56,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:56,853 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 06:21:56,853 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1626312645, now seen corresponding path program 1 times [2019-09-10 06:21:56,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:56,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:59,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:59,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:59,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:59,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:59,845 INFO L87 Difference]: Start difference. First operand 196746 states and 289406 transitions. Second operand 4 states. [2019-09-10 06:22:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:00,589 INFO L93 Difference]: Finished difference Result 334623 states and 490778 transitions. [2019-09-10 06:22:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:00,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:22:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:00,972 INFO L225 Difference]: With dead ends: 334623 [2019-09-10 06:22:00,972 INFO L226 Difference]: Without dead ends: 334623 [2019-09-10 06:22:00,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334623 states. [2019-09-10 06:22:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334623 to 191379. [2019-09-10 06:22:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191379 states. [2019-09-10 06:22:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191379 states to 191379 states and 281411 transitions. [2019-09-10 06:22:03,790 INFO L78 Accepts]: Start accepts. Automaton has 191379 states and 281411 transitions. Word has length 318 [2019-09-10 06:22:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:03,790 INFO L475 AbstractCegarLoop]: Abstraction has 191379 states and 281411 transitions. [2019-09-10 06:22:03,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 191379 states and 281411 transitions. [2019-09-10 06:22:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:22:03,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:03,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:03,927 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash 991757771, now seen corresponding path program 1 times [2019-09-10 06:22:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:03,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:03,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:04,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:04,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:04,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:04,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:04,093 INFO L87 Difference]: Start difference. First operand 191379 states and 281411 transitions. Second operand 3 states. [2019-09-10 06:22:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:05,781 INFO L93 Difference]: Finished difference Result 340286 states and 499495 transitions. [2019-09-10 06:22:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:05,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 06:22:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:06,154 INFO L225 Difference]: With dead ends: 340286 [2019-09-10 06:22:06,154 INFO L226 Difference]: Without dead ends: 340286 [2019-09-10 06:22:06,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340286 states. [2019-09-10 06:22:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340286 to 191860. [2019-09-10 06:22:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191860 states. [2019-09-10 06:22:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191860 states to 191860 states and 282009 transitions. [2019-09-10 06:22:12,600 INFO L78 Accepts]: Start accepts. Automaton has 191860 states and 282009 transitions. Word has length 321 [2019-09-10 06:22:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:12,601 INFO L475 AbstractCegarLoop]: Abstraction has 191860 states and 282009 transitions. [2019-09-10 06:22:12,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 191860 states and 282009 transitions. [2019-09-10 06:22:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:22:12,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:12,718 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 06:22:12,718 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1596203418, now seen corresponding path program 1 times [2019-09-10 06:22:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:12,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:12,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:13,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:13,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:13,065 INFO L87 Difference]: Start difference. First operand 191860 states and 282009 transitions. Second operand 4 states. [2019-09-10 06:22:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:13,576 INFO L93 Difference]: Finished difference Result 175917 states and 258582 transitions. [2019-09-10 06:22:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:13,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:22:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:13,752 INFO L225 Difference]: With dead ends: 175917 [2019-09-10 06:22:13,752 INFO L226 Difference]: Without dead ends: 171749 [2019-09-10 06:22:13,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171749 states. [2019-09-10 06:22:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171749 to 171422. [2019-09-10 06:22:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171422 states. [2019-09-10 06:22:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171422 states to 171422 states and 251717 transitions. [2019-09-10 06:22:16,270 INFO L78 Accepts]: Start accepts. Automaton has 171422 states and 251717 transitions. Word has length 322 [2019-09-10 06:22:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:16,270 INFO L475 AbstractCegarLoop]: Abstraction has 171422 states and 251717 transitions. [2019-09-10 06:22:16,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 171422 states and 251717 transitions. [2019-09-10 06:22:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:16,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:16,393 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 06:22:16,393 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1412198775, now seen corresponding path program 1 times [2019-09-10 06:22:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:16,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:16,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:16,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:16,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:16,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:16,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:16,557 INFO L87 Difference]: Start difference. First operand 171422 states and 251717 transitions. Second operand 3 states. [2019-09-10 06:22:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:17,786 INFO L93 Difference]: Finished difference Result 308891 states and 451265 transitions. [2019-09-10 06:22:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:17,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 06:22:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:18,141 INFO L225 Difference]: With dead ends: 308891 [2019-09-10 06:22:18,141 INFO L226 Difference]: Without dead ends: 308891 [2019-09-10 06:22:18,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308891 states. [2019-09-10 06:22:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308891 to 308709. [2019-09-10 06:22:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308709 states. [2019-09-10 06:22:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308709 states to 308709 states and 451015 transitions. [2019-09-10 06:22:25,634 INFO L78 Accepts]: Start accepts. Automaton has 308709 states and 451015 transitions. Word has length 326 [2019-09-10 06:22:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:25,634 INFO L475 AbstractCegarLoop]: Abstraction has 308709 states and 451015 transitions. [2019-09-10 06:22:25,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 308709 states and 451015 transitions. [2019-09-10 06:22:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:25,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:25,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:25,907 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash 682818906, now seen corresponding path program 1 times [2019-09-10 06:22:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:25,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:26,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:22:26,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:26,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:22:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:22:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:22:26,349 INFO L87 Difference]: Start difference. First operand 308709 states and 451015 transitions. Second operand 8 states. [2019-09-10 06:22:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:28,851 INFO L93 Difference]: Finished difference Result 539665 states and 778594 transitions. [2019-09-10 06:22:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:28,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 326 [2019-09-10 06:22:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:29,483 INFO L225 Difference]: With dead ends: 539665 [2019-09-10 06:22:29,483 INFO L226 Difference]: Without dead ends: 539665 [2019-09-10 06:22:29,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:22:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539665 states. [2019-09-10 06:22:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539665 to 539663. [2019-09-10 06:22:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539663 states. [2019-09-10 06:22:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539663 states to 539663 states and 778593 transitions. [2019-09-10 06:22:43,808 INFO L78 Accepts]: Start accepts. Automaton has 539663 states and 778593 transitions. Word has length 326 [2019-09-10 06:22:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:43,809 INFO L475 AbstractCegarLoop]: Abstraction has 539663 states and 778593 transitions. [2019-09-10 06:22:43,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:22:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 539663 states and 778593 transitions. [2019-09-10 06:22:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:50,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:50,994 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 06:22:50,994 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1917966747, now seen corresponding path program 1 times [2019-09-10 06:22:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:50,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:50,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:51,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:51,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:51,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:51,477 INFO L87 Difference]: Start difference. First operand 539663 states and 778593 transitions. Second operand 4 states. [2019-09-10 06:22:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:54,576 INFO L93 Difference]: Finished difference Result 998095 states and 1429191 transitions. [2019-09-10 06:22:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:54,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 06:22:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:57,104 INFO L225 Difference]: With dead ends: 998095 [2019-09-10 06:22:57,104 INFO L226 Difference]: Without dead ends: 998095 [2019-09-10 06:22:57,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998095 states. [2019-09-10 06:23:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998095 to 997995. [2019-09-10 06:23:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997995 states. [2019-09-10 06:23:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997995 states to 997995 states and 1429067 transitions. [2019-09-10 06:23:28,924 INFO L78 Accepts]: Start accepts. Automaton has 997995 states and 1429067 transitions. Word has length 326 [2019-09-10 06:23:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,924 INFO L475 AbstractCegarLoop]: Abstraction has 997995 states and 1429067 transitions. [2019-09-10 06:23:28,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 997995 states and 1429067 transitions. [2019-09-10 06:23:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:23:39,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:39,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:39,511 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash -255688787, now seen corresponding path program 1 times [2019-09-10 06:23:39,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:39,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:39,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:39,731 INFO L87 Difference]: Start difference. First operand 997995 states and 1429067 transitions. Second operand 3 states. [2019-09-10 06:23:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:54,689 INFO L93 Difference]: Finished difference Result 1950675 states and 2767646 transitions. [2019-09-10 06:23:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:54,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 06:23:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:57,359 INFO L225 Difference]: With dead ends: 1950675 [2019-09-10 06:23:57,359 INFO L226 Difference]: Without dead ends: 1950675 [2019-09-10 06:23:57,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950675 states. [2019-09-10 06:24:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950675 to 1950339. [2019-09-10 06:24:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950339 states.