java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:06:34,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:06:34,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:06:34,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:06:34,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:06:34,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:06:34,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:06:34,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:06:34,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:06:34,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:06:34,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:06:34,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:06:34,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:06:34,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:06:34,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:06:34,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:06:34,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:06:34,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:06:34,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:06:34,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:06:34,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:06:34,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:06:34,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:06:34,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:06:34,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:06:34,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:06:34,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:06:34,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:06:34,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:06:34,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:06:34,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:06:34,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:06:34,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:06:34,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:06:34,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:06:34,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:06:34,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:06:34,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:06:34,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:06:34,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:06:34,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:06:34,950 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 09:06:34,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:06:34,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:06:34,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:06:34,967 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:06:34,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:06:34,968 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:06:34,968 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:06:34,968 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:06:34,969 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:06:34,969 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:06:34,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:06:34,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:06:34,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:06:34,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:06:34,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:06:34,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:06:34,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:06:34,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:06:34,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:06:34,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:06:34,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:06:34,972 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:06:34,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:06:34,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:34,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:06:34,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:06:34,973 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:06:34,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:06:34,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:06:34,973 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:06:35,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:06:35,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:06:35,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:06:35,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:06:35,024 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:06:35,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 09:06:35,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a774ad1bb/addc53cad8a74b58a86c7e02bb36d9d3/FLAG32b677171 [2019-09-10 09:06:35,944 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:06:35,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 09:06:35,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a774ad1bb/addc53cad8a74b58a86c7e02bb36d9d3/FLAG32b677171 [2019-09-10 09:06:36,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a774ad1bb/addc53cad8a74b58a86c7e02bb36d9d3 [2019-09-10 09:06:36,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:06:36,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:06:36,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:36,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:06:36,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:06:36,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:36" (1/1) ... [2019-09-10 09:06:36,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308db9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:36, skipping insertion in model container [2019-09-10 09:06:36,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:36" (1/1) ... [2019-09-10 09:06:36,496 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:06:36,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:06:39,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:39,241 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:06:41,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:41,159 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:06:41,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41 WrapperNode [2019-09-10 09:06:41,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:41,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:06:41,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:06:41,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:06:41,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (1/1) ... [2019-09-10 09:06:41,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:06:41,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:06:41,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:06:41,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:06:41,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (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 09:06:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:06:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:06:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:06:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:06:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:06:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:06:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:06:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:06:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:06:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:06:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:06:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:06:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:06:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:06:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:06:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:06:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:06:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:06:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:06:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:06:48,308 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:06:48,308 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:06:48,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:48 BoogieIcfgContainer [2019-09-10 09:06:48,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:06:48,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:06:48,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:06:48,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:06:48,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:06:36" (1/3) ... [2019-09-10 09:06:48,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f991a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:48, skipping insertion in model container [2019-09-10 09:06:48,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:41" (2/3) ... [2019-09-10 09:06:48,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f991a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:48, skipping insertion in model container [2019-09-10 09:06:48,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:48" (3/3) ... [2019-09-10 09:06:48,323 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 09:06:48,337 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:06:48,370 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 09:06:48,398 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 09:06:48,446 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:06:48,446 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:06:48,447 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:06:48,447 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:06:48,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:06:48,447 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:06:48,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:06:48,448 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:06:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states. [2019-09-10 09:06:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 09:06:48,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:48,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:48,679 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 652537025, now seen corresponding path program 1 times [2019-09-10 09:06:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:48,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:48,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:49,639 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 09:06:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:49,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:49,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:49,668 INFO L87 Difference]: Start difference. First operand 2515 states. Second operand 4 states. [2019-09-10 09:06:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:50,099 INFO L93 Difference]: Finished difference Result 2521 states and 4407 transitions. [2019-09-10 09:06:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:06:50,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 09:06:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:50,145 INFO L225 Difference]: With dead ends: 2521 [2019-09-10 09:06:50,146 INFO L226 Difference]: Without dead ends: 2511 [2019-09-10 09:06:50,151 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 09:06:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-09-10 09:06:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2019-09-10 09:06:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2019-09-10 09:06:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4317 transitions. [2019-09-10 09:06:50,337 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4317 transitions. Word has length 322 [2019-09-10 09:06:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:50,338 INFO L475 AbstractCegarLoop]: Abstraction has 2511 states and 4317 transitions. [2019-09-10 09:06:50,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4317 transitions. [2019-09-10 09:06:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-10 09:06:50,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:50,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:50,350 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753508, now seen corresponding path program 1 times [2019-09-10 09:06:50,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:50,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:50,890 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 09:06:50,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:50,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:50,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:50,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:50,895 INFO L87 Difference]: Start difference. First operand 2511 states and 4317 transitions. Second operand 3 states. [2019-09-10 09:06:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:51,542 INFO L93 Difference]: Finished difference Result 4315 states and 7336 transitions. [2019-09-10 09:06:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:51,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 386 [2019-09-10 09:06:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:51,577 INFO L225 Difference]: With dead ends: 4315 [2019-09-10 09:06:51,577 INFO L226 Difference]: Without dead ends: 4315 [2019-09-10 09:06:51,579 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 09:06:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-09-10 09:06:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4311. [2019-09-10 09:06:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-09-10 09:06:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7334 transitions. [2019-09-10 09:06:51,738 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7334 transitions. Word has length 386 [2019-09-10 09:06:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:51,739 INFO L475 AbstractCegarLoop]: Abstraction has 4311 states and 7334 transitions. [2019-09-10 09:06:51,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7334 transitions. [2019-09-10 09:06:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-10 09:06:51,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:51,757 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1267474840, now seen corresponding path program 1 times [2019-09-10 09:06:51,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:51,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:52,144 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 09:06:52,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:52,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:52,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:52,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:52,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:52,147 INFO L87 Difference]: Start difference. First operand 4311 states and 7334 transitions. Second operand 3 states. [2019-09-10 09:06:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:52,324 INFO L93 Difference]: Finished difference Result 5350 states and 9099 transitions. [2019-09-10 09:06:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:52,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-10 09:06:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:52,361 INFO L225 Difference]: With dead ends: 5350 [2019-09-10 09:06:52,361 INFO L226 Difference]: Without dead ends: 5350 [2019-09-10 09:06:52,361 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 09:06:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2019-09-10 09:06:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 5346. [2019-09-10 09:06:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5346 states. [2019-09-10 09:06:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 9097 transitions. [2019-09-10 09:06:52,505 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 9097 transitions. Word has length 391 [2019-09-10 09:06:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:52,507 INFO L475 AbstractCegarLoop]: Abstraction has 5346 states and 9097 transitions. [2019-09-10 09:06:52,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 9097 transitions. [2019-09-10 09:06:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-10 09:06:52,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:52,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:52,526 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -105335867, now seen corresponding path program 1 times [2019-09-10 09:06:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:52,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:52,933 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 09:06:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:52,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:52,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:52,935 INFO L87 Difference]: Start difference. First operand 5346 states and 9097 transitions. Second operand 3 states. [2019-09-10 09:06:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:53,229 INFO L93 Difference]: Finished difference Result 9795 states and 16579 transitions. [2019-09-10 09:06:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:53,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-09-10 09:06:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:53,290 INFO L225 Difference]: With dead ends: 9795 [2019-09-10 09:06:53,290 INFO L226 Difference]: Without dead ends: 9795 [2019-09-10 09:06:53,290 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 09:06:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2019-09-10 09:06:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9791. [2019-09-10 09:06:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9791 states. [2019-09-10 09:06:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9791 states to 9791 states and 16577 transitions. [2019-09-10 09:06:53,581 INFO L78 Accepts]: Start accepts. Automaton has 9791 states and 16577 transitions. Word has length 395 [2019-09-10 09:06:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:53,582 INFO L475 AbstractCegarLoop]: Abstraction has 9791 states and 16577 transitions. [2019-09-10 09:06:53,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 16577 transitions. [2019-09-10 09:06:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-10 09:06:53,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:53,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:53,609 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2042629109, now seen corresponding path program 1 times [2019-09-10 09:06:53,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:53,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:53,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:53,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:53,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:54,014 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 09:06:54,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:54,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:54,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:54,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:54,018 INFO L87 Difference]: Start difference. First operand 9791 states and 16577 transitions. Second operand 3 states. [2019-09-10 09:06:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:54,343 INFO L93 Difference]: Finished difference Result 12874 states and 21781 transitions. [2019-09-10 09:06:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:54,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2019-09-10 09:06:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:54,402 INFO L225 Difference]: With dead ends: 12874 [2019-09-10 09:06:54,403 INFO L226 Difference]: Without dead ends: 12874 [2019-09-10 09:06:54,404 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 09:06:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12874 states. [2019-09-10 09:06:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12874 to 12870. [2019-09-10 09:06:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12870 states. [2019-09-10 09:06:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12870 states to 12870 states and 21779 transitions. [2019-09-10 09:06:54,733 INFO L78 Accepts]: Start accepts. Automaton has 12870 states and 21779 transitions. Word has length 400 [2019-09-10 09:06:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:54,733 INFO L475 AbstractCegarLoop]: Abstraction has 12870 states and 21779 transitions. [2019-09-10 09:06:54,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12870 states and 21779 transitions. [2019-09-10 09:06:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:06:54,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:54,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:54,768 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1055821996, now seen corresponding path program 1 times [2019-09-10 09:06:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:54,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:55,152 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 09:06:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:55,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:55,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:55,155 INFO L87 Difference]: Start difference. First operand 12870 states and 21779 transitions. Second operand 3 states. [2019-09-10 09:06:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:55,505 INFO L93 Difference]: Finished difference Result 24287 states and 40887 transitions. [2019-09-10 09:06:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:55,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-10 09:06:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:55,573 INFO L225 Difference]: With dead ends: 24287 [2019-09-10 09:06:55,573 INFO L226 Difference]: Without dead ends: 24287 [2019-09-10 09:06:55,573 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 09:06:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24287 states. [2019-09-10 09:06:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24287 to 24283. [2019-09-10 09:06:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24283 states. [2019-09-10 09:06:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24283 states to 24283 states and 40885 transitions. [2019-09-10 09:06:57,071 INFO L78 Accepts]: Start accepts. Automaton has 24283 states and 40885 transitions. Word has length 404 [2019-09-10 09:06:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:57,072 INFO L475 AbstractCegarLoop]: Abstraction has 24283 states and 40885 transitions. [2019-09-10 09:06:57,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24283 states and 40885 transitions. [2019-09-10 09:06:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 09:06:57,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:57,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:57,125 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1223038760, now seen corresponding path program 1 times [2019-09-10 09:06:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:57,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:57,442 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 09:06:57,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:57,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:57,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:57,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:57,444 INFO L87 Difference]: Start difference. First operand 24283 states and 40885 transitions. Second operand 3 states. [2019-09-10 09:06:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:57,670 INFO L93 Difference]: Finished difference Result 32654 states and 54939 transitions. [2019-09-10 09:06:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-09-10 09:06:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:57,743 INFO L225 Difference]: With dead ends: 32654 [2019-09-10 09:06:57,743 INFO L226 Difference]: Without dead ends: 32654 [2019-09-10 09:06:57,744 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 09:06:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32654 states. [2019-09-10 09:06:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32654 to 32650. [2019-09-10 09:06:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32650 states. [2019-09-10 09:06:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32650 states to 32650 states and 54937 transitions. [2019-09-10 09:06:58,427 INFO L78 Accepts]: Start accepts. Automaton has 32650 states and 54937 transitions. Word has length 409 [2019-09-10 09:06:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:58,428 INFO L475 AbstractCegarLoop]: Abstraction has 32650 states and 54937 transitions. [2019-09-10 09:06:58,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32650 states and 54937 transitions. [2019-09-10 09:06:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-10 09:06:58,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:58,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:58,497 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -963797931, now seen corresponding path program 1 times [2019-09-10 09:06:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:59,199 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 09:06:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:59,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:59,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:59,202 INFO L87 Difference]: Start difference. First operand 32650 states and 54937 transitions. Second operand 3 states. [2019-09-10 09:06:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:59,587 INFO L93 Difference]: Finished difference Result 62259 states and 104169 transitions. [2019-09-10 09:06:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:59,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2019-09-10 09:06:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:59,746 INFO L225 Difference]: With dead ends: 62259 [2019-09-10 09:06:59,746 INFO L226 Difference]: Without dead ends: 62259 [2019-09-10 09:06:59,747 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 09:06:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62259 states. [2019-09-10 09:07:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62259 to 62255. [2019-09-10 09:07:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62255 states. [2019-09-10 09:07:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62255 states to 62255 states and 104167 transitions. [2019-09-10 09:07:00,905 INFO L78 Accepts]: Start accepts. Automaton has 62255 states and 104167 transitions. Word has length 413 [2019-09-10 09:07:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:00,906 INFO L475 AbstractCegarLoop]: Abstraction has 62255 states and 104167 transitions. [2019-09-10 09:07:00,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 62255 states and 104167 transitions. [2019-09-10 09:07:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-10 09:07:00,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:00,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:00,999 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1387016581, now seen corresponding path program 1 times [2019-09-10 09:07:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:01,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:02,703 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 09:07:02,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:02,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:02,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:02,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:02,705 INFO L87 Difference]: Start difference. First operand 62255 states and 104167 transitions. Second operand 3 states. [2019-09-10 09:07:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:03,110 INFO L93 Difference]: Finished difference Result 84026 states and 140433 transitions. [2019-09-10 09:07:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:03,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-10 09:07:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:03,334 INFO L225 Difference]: With dead ends: 84026 [2019-09-10 09:07:03,335 INFO L226 Difference]: Without dead ends: 84026 [2019-09-10 09:07:03,336 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 09:07:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84026 states. [2019-09-10 09:07:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84026 to 84022. [2019-09-10 09:07:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84022 states. [2019-09-10 09:07:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84022 states to 84022 states and 140431 transitions. [2019-09-10 09:07:05,099 INFO L78 Accepts]: Start accepts. Automaton has 84022 states and 140431 transitions. Word has length 418 [2019-09-10 09:07:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:05,100 INFO L475 AbstractCegarLoop]: Abstraction has 84022 states and 140431 transitions. [2019-09-10 09:07:05,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84022 states and 140431 transitions. [2019-09-10 09:07:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-10 09:07:05,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:05,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:05,186 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 947745956, now seen corresponding path program 1 times [2019-09-10 09:07:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:05,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:05,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:05,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:05,516 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 09:07:05,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:05,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:05,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:05,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:05,521 INFO L87 Difference]: Start difference. First operand 84022 states and 140431 transitions. Second operand 3 states. [2019-09-10 09:07:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:06,158 INFO L93 Difference]: Finished difference Result 160343 states and 266235 transitions. [2019-09-10 09:07:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:06,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-09-10 09:07:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:06,412 INFO L225 Difference]: With dead ends: 160343 [2019-09-10 09:07:06,412 INFO L226 Difference]: Without dead ends: 160343 [2019-09-10 09:07:06,412 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 09:07:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160343 states. [2019-09-10 09:07:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160343 to 160339. [2019-09-10 09:07:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160339 states. [2019-09-10 09:07:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160339 states to 160339 states and 266233 transitions. [2019-09-10 09:07:10,433 INFO L78 Accepts]: Start accepts. Automaton has 160339 states and 266233 transitions. Word has length 422 [2019-09-10 09:07:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:10,433 INFO L475 AbstractCegarLoop]: Abstraction has 160339 states and 266233 transitions. [2019-09-10 09:07:10,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 160339 states and 266233 transitions. [2019-09-10 09:07:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-10 09:07:10,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:10,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:10,578 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1032358384, now seen corresponding path program 1 times [2019-09-10 09:07:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:10,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:11,502 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 09:07:11,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:11,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:11,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:11,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:11,505 INFO L87 Difference]: Start difference. First operand 160339 states and 266233 transitions. Second operand 3 states. [2019-09-10 09:07:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:12,346 INFO L93 Difference]: Finished difference Result 214942 states and 356167 transitions. [2019-09-10 09:07:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:12,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 427 [2019-09-10 09:07:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:12,605 INFO L225 Difference]: With dead ends: 214942 [2019-09-10 09:07:12,605 INFO L226 Difference]: Without dead ends: 214942 [2019-09-10 09:07:12,606 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 09:07:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214942 states. [2019-09-10 09:07:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214942 to 214938. [2019-09-10 09:07:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214938 states. [2019-09-10 09:07:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214938 states to 214938 states and 356165 transitions. [2019-09-10 09:07:18,519 INFO L78 Accepts]: Start accepts. Automaton has 214938 states and 356165 transitions. Word has length 427 [2019-09-10 09:07:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:18,519 INFO L475 AbstractCegarLoop]: Abstraction has 214938 states and 356165 transitions. [2019-09-10 09:07:18,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 214938 states and 356165 transitions. [2019-09-10 09:07:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-10 09:07:18,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:18,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:18,661 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:18,662 INFO L82 PathProgramCache]: Analyzing trace with hash 592132413, now seen corresponding path program 1 times [2019-09-10 09:07:18,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:18,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:20,575 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 09:07:20,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:20,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:07:20,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:20,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:07:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:07:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:07:20,578 INFO L87 Difference]: Start difference. First operand 214938 states and 356165 transitions. Second operand 7 states. [2019-09-10 09:07:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:33,319 INFO L93 Difference]: Finished difference Result 1380199 states and 2292196 transitions. [2019-09-10 09:07:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:07:33,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 431 [2019-09-10 09:07:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:35,480 INFO L225 Difference]: With dead ends: 1380199 [2019-09-10 09:07:35,480 INFO L226 Difference]: Without dead ends: 1380199 [2019-09-10 09:07:35,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:07:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380199 states. [2019-09-10 09:07:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380199 to 427813. [2019-09-10 09:07:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427813 states. [2019-09-10 09:07:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427813 states to 427813 states and 706031 transitions. [2019-09-10 09:07:56,692 INFO L78 Accepts]: Start accepts. Automaton has 427813 states and 706031 transitions. Word has length 431 [2019-09-10 09:07:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:56,693 INFO L475 AbstractCegarLoop]: Abstraction has 427813 states and 706031 transitions. [2019-09-10 09:07:56,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:07:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 427813 states and 706031 transitions. [2019-09-10 09:07:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-10 09:07:56,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:56,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:56,983 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash 586524213, now seen corresponding path program 1 times [2019-09-10 09:07:56,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:56,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:56,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:56,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:56,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:57,375 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 09:07:57,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:57,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:57,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:57,379 INFO L87 Difference]: Start difference. First operand 427813 states and 706031 transitions. Second operand 4 states. [2019-09-10 09:08:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:07,014 INFO L93 Difference]: Finished difference Result 845366 states and 1399005 transitions. [2019-09-10 09:08:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:07,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-09-10 09:08:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:08,443 INFO L225 Difference]: With dead ends: 845366 [2019-09-10 09:08:08,443 INFO L226 Difference]: Without dead ends: 845366 [2019-09-10 09:08:08,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:08:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845366 states. [2019-09-10 09:08:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845366 to 705994. [2019-09-10 09:08:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705994 states. [2019-09-10 09:08:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705994 states to 705994 states and 1165461 transitions. [2019-09-10 09:08:37,285 INFO L78 Accepts]: Start accepts. Automaton has 705994 states and 1165461 transitions. Word has length 433 [2019-09-10 09:08:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:37,286 INFO L475 AbstractCegarLoop]: Abstraction has 705994 states and 1165461 transitions. [2019-09-10 09:08:37,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:08:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 705994 states and 1165461 transitions. [2019-09-10 09:08:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-09-10 09:08:37,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:37,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:37,738 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -713679510, now seen corresponding path program 1 times [2019-09-10 09:08:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:37,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:38,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:38,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:08:38,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:38,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:08:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:08:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:08:38,048 INFO L87 Difference]: Start difference. First operand 705994 states and 1165461 transitions. Second operand 4 states. [2019-09-10 09:08:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:54,230 INFO L93 Difference]: Finished difference Result 1386509 states and 2287239 transitions. [2019-09-10 09:08:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:08:54,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-09-10 09:08:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:57,650 INFO L225 Difference]: With dead ends: 1386509 [2019-09-10 09:08:57,651 INFO L226 Difference]: Without dead ends: 1386509 [2019-09-10 09:08:57,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:08:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386509 states. [2019-09-10 09:09:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386509 to 1160205. [2019-09-10 09:09:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160205 states. [2019-09-10 09:09:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160205 states to 1160205 states and 1910569 transitions. [2019-09-10 09:09:48,590 INFO L78 Accepts]: Start accepts. Automaton has 1160205 states and 1910569 transitions. Word has length 434 [2019-09-10 09:09:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:48,591 INFO L475 AbstractCegarLoop]: Abstraction has 1160205 states and 1910569 transitions. [2019-09-10 09:09:48,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:09:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1160205 states and 1910569 transitions. [2019-09-10 09:09:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-09-10 09:09:51,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:51,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:09:51,979 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1872307236, now seen corresponding path program 1 times [2019-09-10 09:09:51,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:51,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:51,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:51,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:52,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:09:52,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:09:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:09:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:09:52,713 INFO L87 Difference]: Start difference. First operand 1160205 states and 1910569 transitions. Second operand 4 states. [2019-09-10 09:10:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:10:11,203 INFO L93 Difference]: Finished difference Result 2277413 states and 3747379 transitions. [2019-09-10 09:10:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:10:11,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 435 [2019-09-10 09:10:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:10:26,109 INFO L225 Difference]: With dead ends: 2277413 [2019-09-10 09:10:26,109 INFO L226 Difference]: Without dead ends: 2277413 [2019-09-10 09:10:26,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:10:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277413 states.