java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:53:35,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:53:35,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:53:35,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:53:35,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:53:35,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:53:35,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:53:35,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:53:35,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:53:35,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:53:35,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:53:35,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:53:35,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:53:35,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:53:35,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:53:35,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:53:35,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:53:35,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:53:35,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:53:35,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:53:35,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:53:35,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:53:35,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:53:35,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:53:35,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:53:35,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:53:35,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:53:35,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:53:35,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:53:35,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:53:35,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:53:35,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:53:35,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:53:35,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:53:35,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:53:35,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:53:35,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:53:35,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:53:35,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:53:35,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:53:35,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:53:35,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:53:35,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:53:35,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:53:35,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:53:35,949 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:53:35,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:53:35,949 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:53:35,952 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:53:35,952 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:53:35,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:53:35,953 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:53:35,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:53:35,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:53:35,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:53:35,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:53:35,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:53:35,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:53:35,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:53:35,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:53:35,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:53:35,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:53:35,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:53:35,956 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:53:35,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:53:35,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:53:35,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:53:35,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:53:35,957 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:53:35,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:53:35,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:53:35,957 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:53:35,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:53:36,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:53:36,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:53:36,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:53:36,008 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:53:36,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:53:36,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ec9342b/d1a36f98ac0543bda656b92184d8b18a/FLAG2b3124964 [2019-09-10 08:53:36,663 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:53:36,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:53:36,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ec9342b/d1a36f98ac0543bda656b92184d8b18a/FLAG2b3124964 [2019-09-10 08:53:36,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ec9342b/d1a36f98ac0543bda656b92184d8b18a [2019-09-10 08:53:36,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:53:36,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:53:36,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:53:36,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:53:36,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:53:36,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:53:36" (1/1) ... [2019-09-10 08:53:36,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1332b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:36, skipping insertion in model container [2019-09-10 08:53:36,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:53:36" (1/1) ... [2019-09-10 08:53:36,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:53:37,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:53:37,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:53:37,590 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:53:37,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:53:37,789 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:53:37,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37 WrapperNode [2019-09-10 08:53:37,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:53:37,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:53:37,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:53:37,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:53:37,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... [2019-09-10 08:53:37,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:53:37,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:53:37,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:53:37,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:53:37,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:53:37,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:53:37,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:53:37,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:53:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:53:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:53:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:53:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:53:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:53:38,000 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:53:38,000 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:53:38,000 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:53:38,001 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:53:38,001 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:53:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:53:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:53:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:53:38,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:53:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:53:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:53:39,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:53:39,695 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:53:39,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:53:39 BoogieIcfgContainer [2019-09-10 08:53:39,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:53:39,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:53:39,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:53:39,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:53:39,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:53:36" (1/3) ... [2019-09-10 08:53:39,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715dd1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:53:39, skipping insertion in model container [2019-09-10 08:53:39,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:53:37" (2/3) ... [2019-09-10 08:53:39,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715dd1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:53:39, skipping insertion in model container [2019-09-10 08:53:39,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:53:39" (3/3) ... [2019-09-10 08:53:39,705 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:53:39,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:53:39,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:53:39,740 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:53:39,767 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:53:39,767 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:53:39,767 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:53:39,768 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:53:39,768 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:53:39,768 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:53:39,768 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:53:39,768 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:53:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-10 08:53:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:53:39,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:39,816 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] [2019-09-10 08:53:39,818 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:39,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-10 08:53:39,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:39,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:40,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:40,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:40,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:40,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:40,435 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-10 08:53:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:40,600 INFO L93 Difference]: Finished difference Result 485 states and 839 transitions. [2019-09-10 08:53:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:40,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:53:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:40,629 INFO L225 Difference]: With dead ends: 485 [2019-09-10 08:53:40,630 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 08:53:40,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 08:53:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-10 08:53:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-10 08:53:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-10 08:53:40,718 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-10 08:53:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:40,719 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-10 08:53:40,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-10 08:53:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:53:40,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:40,726 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] [2019-09-10 08:53:40,727 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-10 08:53:40,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:40,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:40,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:40,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:40,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:40,986 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-10 08:53:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:41,031 INFO L93 Difference]: Finished difference Result 733 states and 1211 transitions. [2019-09-10 08:53:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:41,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:53:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:41,040 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:53:41,040 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:53:41,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:53:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-10 08:53:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-10 08:53:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-10 08:53:41,077 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-10 08:53:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:41,078 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-10 08:53:41,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-10 08:53:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:53:41,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:41,081 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] [2019-09-10 08:53:41,082 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-10 08:53:41,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:41,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:41,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:41,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:41,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:41,290 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-10 08:53:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:41,335 INFO L93 Difference]: Finished difference Result 1225 states and 2027 transitions. [2019-09-10 08:53:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:41,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:53:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:41,348 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 08:53:41,349 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 08:53:41,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 08:53:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-10 08:53:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-10 08:53:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-10 08:53:41,406 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-10 08:53:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:41,409 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-10 08:53:41,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-10 08:53:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:53:41,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:41,413 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] [2019-09-10 08:53:41,413 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-10 08:53:41,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:41,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:41,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:41,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:41,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:41,729 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-10 08:53:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:41,789 INFO L93 Difference]: Finished difference Result 2169 states and 3583 transitions. [2019-09-10 08:53:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:41,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:53:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:41,806 INFO L225 Difference]: With dead ends: 2169 [2019-09-10 08:53:41,806 INFO L226 Difference]: Without dead ends: 2169 [2019-09-10 08:53:41,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-10 08:53:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-10 08:53:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-10 08:53:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-10 08:53:41,876 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-10 08:53:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:41,877 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-10 08:53:41,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-10 08:53:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:53:41,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:41,883 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] [2019-09-10 08:53:41,883 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:41,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-10 08:53:41,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:41,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:41,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:42,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:42,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:42,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:42,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:42,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:42,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:42,193 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-10 08:53:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:42,526 INFO L93 Difference]: Finished difference Result 6263 states and 10406 transitions. [2019-09-10 08:53:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:42,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:53:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:42,556 INFO L225 Difference]: With dead ends: 6263 [2019-09-10 08:53:42,556 INFO L226 Difference]: Without dead ends: 6263 [2019-09-10 08:53:42,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:53:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-10 08:53:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-10 08:53:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-10 08:53:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-10 08:53:42,693 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-10 08:53:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:42,693 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-10 08:53:42,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-10 08:53:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:53:42,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:42,698 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] [2019-09-10 08:53:42,698 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-10 08:53:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:42,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:42,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:42,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:42,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:42,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:42,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:42,874 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-10 08:53:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:43,030 INFO L93 Difference]: Finished difference Result 8327 states and 13848 transitions. [2019-09-10 08:53:43,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:43,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:53:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:43,069 INFO L225 Difference]: With dead ends: 8327 [2019-09-10 08:53:43,069 INFO L226 Difference]: Without dead ends: 8327 [2019-09-10 08:53:43,070 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 08:53:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-10 08:53:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-10 08:53:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 08:53:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-10 08:53:43,373 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-10 08:53:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:43,374 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-10 08:53:43,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-10 08:53:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:53:43,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:43,382 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] [2019-09-10 08:53:43,382 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash -104060438, now seen corresponding path program 1 times [2019-09-10 08:53:43,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:43,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:43,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:43,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:43,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:43,499 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-10 08:53:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:43,576 INFO L93 Difference]: Finished difference Result 11099 states and 18426 transitions. [2019-09-10 08:53:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:43,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:53:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:43,634 INFO L225 Difference]: With dead ends: 11099 [2019-09-10 08:53:43,634 INFO L226 Difference]: Without dead ends: 11099 [2019-09-10 08:53:43,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-10 08:53:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-10 08:53:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-10 08:53:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-10 08:53:43,882 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-10 08:53:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:43,882 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-10 08:53:43,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-10 08:53:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:53:43,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:43,885 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] [2019-09-10 08:53:43,885 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-10 08:53:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:44,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:44,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:44,087 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-10 08:53:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:44,232 INFO L93 Difference]: Finished difference Result 15670 states and 25957 transitions. [2019-09-10 08:53:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:44,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:53:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:44,268 INFO L225 Difference]: With dead ends: 15670 [2019-09-10 08:53:44,269 INFO L226 Difference]: Without dead ends: 15670 [2019-09-10 08:53:44,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-10 08:53:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-10 08:53:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-10 08:53:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-10 08:53:44,572 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-10 08:53:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:44,572 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-10 08:53:44,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-10 08:53:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:53:44,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:44,575 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] [2019-09-10 08:53:44,575 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-10 08:53:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:44,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:44,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:44,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:44,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:44,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:44,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:44,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:44,733 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-10 08:53:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:45,039 INFO L93 Difference]: Finished difference Result 26712 states and 44251 transitions. [2019-09-10 08:53:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:45,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:53:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:45,212 INFO L225 Difference]: With dead ends: 26712 [2019-09-10 08:53:45,212 INFO L226 Difference]: Without dead ends: 26712 [2019-09-10 08:53:45,213 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 08:53:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-10 08:53:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-10 08:53:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-10 08:53:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-10 08:53:45,621 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-10 08:53:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:45,621 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-10 08:53:45,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-10 08:53:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:53:45,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:45,624 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] [2019-09-10 08:53:45,624 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-10 08:53:45,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:45,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:45,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:45,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:45,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:45,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:45,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:45,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:45,739 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-10 08:53:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:46,506 INFO L93 Difference]: Finished difference Result 33980 states and 56028 transitions. [2019-09-10 08:53:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:46,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:53:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:46,602 INFO L225 Difference]: With dead ends: 33980 [2019-09-10 08:53:46,602 INFO L226 Difference]: Without dead ends: 33980 [2019-09-10 08:53:46,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-10 08:53:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-10 08:53:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-10 08:53:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-10 08:53:47,100 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-10 08:53:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:47,101 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-10 08:53:47,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-10 08:53:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:53:47,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:47,104 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] [2019-09-10 08:53:47,104 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-10 08:53:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:47,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:47,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:47,224 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-10 08:53:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:47,624 INFO L93 Difference]: Finished difference Result 50517 states and 82988 transitions. [2019-09-10 08:53:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:47,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:53:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:47,757 INFO L225 Difference]: With dead ends: 50517 [2019-09-10 08:53:47,757 INFO L226 Difference]: Without dead ends: 50517 [2019-09-10 08:53:47,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-10 08:53:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-10 08:53:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-10 08:53:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-10 08:53:49,618 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-10 08:53:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:49,619 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-10 08:53:49,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-10 08:53:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:53:49,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:49,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:49,622 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-10 08:53:49,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:49,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:49,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:49,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:53:49,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:49,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:53:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:53:49,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:53:49,800 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-10 08:53:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:50,798 INFO L93 Difference]: Finished difference Result 185545 states and 303013 transitions. [2019-09-10 08:53:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:53:50,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:53:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:51,316 INFO L225 Difference]: With dead ends: 185545 [2019-09-10 08:53:51,316 INFO L226 Difference]: Without dead ends: 185545 [2019-09-10 08:53:51,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:53:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-10 08:53:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-10 08:53:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-10 08:53:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-10 08:53:54,748 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-10 08:53:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:54,748 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-10 08:53:54,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:53:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-10 08:53:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:53:54,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:54,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:53:54,751 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-10 08:53:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:54,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:54,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:56,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:56,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:56,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:56,616 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-10 08:53:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:57,341 INFO L93 Difference]: Finished difference Result 274270 states and 446077 transitions. [2019-09-10 08:53:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:57,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:53:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:57,703 INFO L225 Difference]: With dead ends: 274270 [2019-09-10 08:53:57,703 INFO L226 Difference]: Without dead ends: 274270 [2019-09-10 08:53:57,703 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 08:53:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-10 08:54:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-10 08:54:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-10 08:54:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-10 08:54:05,569 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-10 08:54:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:05,570 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-10 08:54:05,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-10 08:54:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:54:05,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:05,572 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] [2019-09-10 08:54:05,572 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-10 08:54:05,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:05,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:05,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:05,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:05,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:05,880 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-10 08:54:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:06,842 INFO L93 Difference]: Finished difference Result 298865 states and 485662 transitions. [2019-09-10 08:54:06,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:54:06,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:54:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:07,264 INFO L225 Difference]: With dead ends: 298865 [2019-09-10 08:54:07,264 INFO L226 Difference]: Without dead ends: 298865 [2019-09-10 08:54:07,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:54:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-10 08:54:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-10 08:54:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-10 08:54:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-10 08:54:14,178 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-10 08:54:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:14,179 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-10 08:54:14,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-10 08:54:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:54:14,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:14,181 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] [2019-09-10 08:54:14,181 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-10 08:54:14,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:14,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:14,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:14,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:14,471 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-10 08:54:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:15,756 INFO L93 Difference]: Finished difference Result 436607 states and 708162 transitions. [2019-09-10 08:54:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:54:15,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:54:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:21,788 INFO L225 Difference]: With dead ends: 436607 [2019-09-10 08:54:21,788 INFO L226 Difference]: Without dead ends: 436607 [2019-09-10 08:54:21,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436607 states. [2019-09-10 08:54:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436607 to 420187. [2019-09-10 08:54:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-10 08:54:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-10 08:54:26,931 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-10 08:54:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:26,931 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-10 08:54:26,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-10 08:54:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:54:26,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:26,932 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] [2019-09-10 08:54:26,933 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-10 08:54:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:27,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:27,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:27,128 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-10 08:54:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:30,531 INFO L93 Difference]: Finished difference Result 704201 states and 1133907 transitions. [2019-09-10 08:54:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:54:30,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:54:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:31,720 INFO L225 Difference]: With dead ends: 704201 [2019-09-10 08:54:31,721 INFO L226 Difference]: Without dead ends: 704201 [2019-09-10 08:54:31,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-10 08:54:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-10 08:54:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-10 08:54:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-10 08:54:47,913 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-10 08:54:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:47,914 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-10 08:54:47,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-10 08:54:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:54:47,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:47,923 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:47,923 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1798813421, now seen corresponding path program 1 times [2019-09-10 08:54:47,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:47,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:54:48,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:48,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:48,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:48,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:48,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:48,051 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 3 states. [2019-09-10 08:54:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:56,229 INFO L93 Difference]: Finished difference Result 689649 states and 1112035 transitions. [2019-09-10 08:54:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:56,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 08:54:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:57,347 INFO L225 Difference]: With dead ends: 689649 [2019-09-10 08:54:57,347 INFO L226 Difference]: Without dead ends: 689649 [2019-09-10 08:54:57,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689649 states. [2019-09-10 08:55:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689649 to 688898. [2019-09-10 08:55:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688898 states. [2019-09-10 08:55:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688898 states to 688898 states and 1111285 transitions. [2019-09-10 08:55:11,690 INFO L78 Accepts]: Start accepts. Automaton has 688898 states and 1111285 transitions. Word has length 178 [2019-09-10 08:55:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:11,690 INFO L475 AbstractCegarLoop]: Abstraction has 688898 states and 1111285 transitions. [2019-09-10 08:55:11,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 688898 states and 1111285 transitions. [2019-09-10 08:55:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:55:11,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:11,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:11,702 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1203955643, now seen corresponding path program 1 times [2019-09-10 08:55:11,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:55:11,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:55:11,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:11,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:55:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:55:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:11,900 INFO L87 Difference]: Start difference. First operand 688898 states and 1111285 transitions. Second operand 6 states. [2019-09-10 08:55:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:22,530 INFO L93 Difference]: Finished difference Result 857696 states and 1385067 transitions. [2019-09-10 08:55:22,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:22,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-10 08:55:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:23,913 INFO L225 Difference]: With dead ends: 857696 [2019-09-10 08:55:23,913 INFO L226 Difference]: Without dead ends: 857696 [2019-09-10 08:55:23,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:55:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857696 states. [2019-09-10 08:55:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857696 to 781194. [2019-09-10 08:55:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781194 states. [2019-09-10 08:55:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781194 states to 781194 states and 1260140 transitions. [2019-09-10 08:55:52,663 INFO L78 Accepts]: Start accepts. Automaton has 781194 states and 1260140 transitions. Word has length 178 [2019-09-10 08:55:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:52,663 INFO L475 AbstractCegarLoop]: Abstraction has 781194 states and 1260140 transitions. [2019-09-10 08:55:52,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:55:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 781194 states and 1260140 transitions. [2019-09-10 08:55:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:55:52,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:52,670 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:52,670 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-10 08:55:52,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:52,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:52,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:52,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:55:52,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:55:52,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-09-10 08:55:52,857 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [265], [300], [335], [370], [373], [395], [398], [401], [403], [405], [408], [411], [414], [417], [420], [427], [435], [437], [440], [441], [443], [452], [455], [466], [469], [481], [489], [493], [497], [499], [502], [548], [558], [568], [578], [598], [601], [647], [657], [667], [677], [697], [700], [746], [756], [766], [776], [796], [799], [845], [855], [865], [875], [1504], [1505], [1509], [1510], [1511] [2019-09-10 08:55:52,936 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:55:52,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:55:53,183 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:55:53,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:55:53,686 INFO L272 AbstractInterpreter]: Visited 151 different actions 402 times. Merged at 47 different actions 236 times. Widened at 24 different actions 25 times. Performed 1495 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1495 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 297 variables. [2019-09-10 08:55:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:53,692 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:55:54,546 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 87.97% of their original sizes. [2019-09-10 08:55:54,547 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:56:35,544 INFO L420 sIntCurrentIteration]: We unified 177 AI predicates to 177 [2019-09-10 08:56:35,545 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:56:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:56:35,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [112] imperfect sequences [5] total 115 [2019-09-10 08:56:35,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:35,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-10 08:56:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-10 08:56:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1876, Invalid=10556, Unknown=0, NotChecked=0, Total=12432 [2019-09-10 08:56:35,552 INFO L87 Difference]: Start difference. First operand 781194 states and 1260140 transitions. Second operand 112 states. [2019-09-10 09:01:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:07,554 INFO L93 Difference]: Finished difference Result 2833972 states and 4484815 transitions. [2019-09-10 09:01:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-09-10 09:01:07,554 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 178 [2019-09-10 09:01:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:14,212 INFO L225 Difference]: With dead ends: 2833972 [2019-09-10 09:01:14,213 INFO L226 Difference]: Without dead ends: 2833972 [2019-09-10 09:01:14,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24010 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=7644, Invalid=56618, Unknown=0, NotChecked=0, Total=64262 [2019-09-10 09:01:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833972 states. [2019-09-10 09:02:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833972 to 1136109. [2019-09-10 09:02:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136109 states.