java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:28:49,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:28:49,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:28:49,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:28:49,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:28:49,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:28:49,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:28:49,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:28:49,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:28:49,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:28:49,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:28:49,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:28:49,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:28:49,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:28:49,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:28:49,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:28:49,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:28:49,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:28:49,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:28:49,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:28:49,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:28:49,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:28:49,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:28:49,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:28:49,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:28:49,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:28:49,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:28:49,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:28:49,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:28:49,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:28:49,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:28:49,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:28:49,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:28:49,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:28:49,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:28:49,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:28:49,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:28:49,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:28:49,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:28:49,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:28:49,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:28:49,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:28:49,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:28:49,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:28:49,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:28:49,846 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:28:49,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:28:49,847 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:28:49,847 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:28:49,847 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:28:49,847 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:28:49,848 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:28:49,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:28:49,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:28:49,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:28:49,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:28:49,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:28:49,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:28:49,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:28:49,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:28:49,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:28:49,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:28:49,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:28:49,851 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:28:49,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:28:49,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:28:49,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:28:49,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:28:49,852 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:28:49,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:28:49,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:28:49,852 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:28:49,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:28:49,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:28:49,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:28:49,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:28:49,905 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:28:49,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:28:49,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a397b65f/e0e77c3ea25546f099a12188df3587f6/FLAG11dc191ce [2019-09-10 06:28:50,719 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:28:50,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:28:50,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a397b65f/e0e77c3ea25546f099a12188df3587f6/FLAG11dc191ce [2019-09-10 06:28:50,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a397b65f/e0e77c3ea25546f099a12188df3587f6 [2019-09-10 06:28:50,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:28:50,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:28:50,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:28:50,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:28:50,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:28:50,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:28:50" (1/1) ... [2019-09-10 06:28:50,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce0009e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:50, skipping insertion in model container [2019-09-10 06:28:50,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:28:50" (1/1) ... [2019-09-10 06:28:50,948 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:28:51,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:28:51,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:28:51,884 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:28:52,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:28:52,206 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:28:52,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52 WrapperNode [2019-09-10 06:28:52,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:28:52,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:28:52,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:28:52,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:28:52,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... [2019-09-10 06:28:52,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:28:52,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:28:52,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:28:52,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:28:52,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:28:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:28:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:28:52,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:28:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:28:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:28:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:28:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:28:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:28:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:28:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:28:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:28:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:28:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:28:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:28:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:28:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:28:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:28:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:28:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:28:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:28:54,924 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:28:54,924 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:28:54,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:28:54 BoogieIcfgContainer [2019-09-10 06:28:54,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:28:54,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:28:54,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:28:54,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:28:54,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:28:50" (1/3) ... [2019-09-10 06:28:54,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16f426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:28:54, skipping insertion in model container [2019-09-10 06:28:54,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:28:52" (2/3) ... [2019-09-10 06:28:54,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16f426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:28:54, skipping insertion in model container [2019-09-10 06:28:54,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:28:54" (3/3) ... [2019-09-10 06:28:54,934 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:28:54,945 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:28:54,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:28:54,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:28:54,996 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:28:54,996 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:28:54,996 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:28:54,996 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:28:54,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:28:54,997 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:28:54,997 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:28:54,997 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:28:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-09-10 06:28:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 06:28:55,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:55,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:55,115 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1863658618, now seen corresponding path program 1 times [2019-09-10 06:28:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:55,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:55,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:55,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:55,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:55,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:55,917 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 3 states. [2019-09-10 06:28:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:56,084 INFO L93 Difference]: Finished difference Result 902 states and 1614 transitions. [2019-09-10 06:28:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:56,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 06:28:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:56,112 INFO L225 Difference]: With dead ends: 902 [2019-09-10 06:28:56,113 INFO L226 Difference]: Without dead ends: 894 [2019-09-10 06:28:56,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-10 06:28:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 892. [2019-09-10 06:28:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-10 06:28:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1564 transitions. [2019-09-10 06:28:56,225 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1564 transitions. Word has length 188 [2019-09-10 06:28:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:56,228 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1564 transitions. [2019-09-10 06:28:56,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1564 transitions. [2019-09-10 06:28:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 06:28:56,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:56,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:56,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash -229379037, now seen corresponding path program 1 times [2019-09-10 06:28:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:56,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:56,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:56,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:56,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:56,631 INFO L87 Difference]: Start difference. First operand 892 states and 1564 transitions. Second operand 3 states. [2019-09-10 06:28:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:56,684 INFO L93 Difference]: Finished difference Result 1235 states and 2137 transitions. [2019-09-10 06:28:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:56,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 06:28:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:56,694 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 06:28:56,694 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 06:28:56,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 06:28:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1233. [2019-09-10 06:28:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-09-10 06:28:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2136 transitions. [2019-09-10 06:28:56,741 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2136 transitions. Word has length 192 [2019-09-10 06:28:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:56,742 INFO L475 AbstractCegarLoop]: Abstraction has 1233 states and 2136 transitions. [2019-09-10 06:28:56,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2136 transitions. [2019-09-10 06:28:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 06:28:56,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:56,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:56,749 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1188495585, now seen corresponding path program 1 times [2019-09-10 06:28:56,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:56,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:56,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:56,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:56,945 INFO L87 Difference]: Start difference. First operand 1233 states and 2136 transitions. Second operand 3 states. [2019-09-10 06:28:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:56,998 INFO L93 Difference]: Finished difference Result 1569 states and 2699 transitions. [2019-09-10 06:28:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:56,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 06:28:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:57,017 INFO L225 Difference]: With dead ends: 1569 [2019-09-10 06:28:57,018 INFO L226 Difference]: Without dead ends: 1569 [2019-09-10 06:28:57,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2019-09-10 06:28:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1567. [2019-09-10 06:28:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-09-10 06:28:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2698 transitions. [2019-09-10 06:28:57,064 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2698 transitions. Word has length 196 [2019-09-10 06:28:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:57,065 INFO L475 AbstractCegarLoop]: Abstraction has 1567 states and 2698 transitions. [2019-09-10 06:28:57,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2698 transitions. [2019-09-10 06:28:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 06:28:57,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:57,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:57,070 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1919463846, now seen corresponding path program 1 times [2019-09-10 06:28:57,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:57,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:57,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,314 INFO L87 Difference]: Start difference. First operand 1567 states and 2698 transitions. Second operand 3 states. [2019-09-10 06:28:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:57,380 INFO L93 Difference]: Finished difference Result 2504 states and 4257 transitions. [2019-09-10 06:28:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:57,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 06:28:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:57,398 INFO L225 Difference]: With dead ends: 2504 [2019-09-10 06:28:57,398 INFO L226 Difference]: Without dead ends: 2504 [2019-09-10 06:28:57,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-09-10 06:28:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2502. [2019-09-10 06:28:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2019-09-10 06:28:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4256 transitions. [2019-09-10 06:28:57,482 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4256 transitions. Word has length 196 [2019-09-10 06:28:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:57,482 INFO L475 AbstractCegarLoop]: Abstraction has 2502 states and 4256 transitions. [2019-09-10 06:28:57,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4256 transitions. [2019-09-10 06:28:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 06:28:57,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:57,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:57,488 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 357755907, now seen corresponding path program 1 times [2019-09-10 06:28:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:57,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 06:28:57,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:57,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:57,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:57,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,736 INFO L87 Difference]: Start difference. First operand 2502 states and 4256 transitions. Second operand 3 states. [2019-09-10 06:28:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:57,796 INFO L93 Difference]: Finished difference Result 4308 states and 7241 transitions. [2019-09-10 06:28:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:57,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 06:28:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:57,821 INFO L225 Difference]: With dead ends: 4308 [2019-09-10 06:28:57,821 INFO L226 Difference]: Without dead ends: 4308 [2019-09-10 06:28:57,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2019-09-10 06:28:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 4306. [2019-09-10 06:28:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4306 states. [2019-09-10 06:28:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 7240 transitions. [2019-09-10 06:28:57,994 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 7240 transitions. Word has length 200 [2019-09-10 06:28:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:57,995 INFO L475 AbstractCegarLoop]: Abstraction has 4306 states and 7240 transitions. [2019-09-10 06:28:57,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 7240 transitions. [2019-09-10 06:28:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 06:28:58,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:58,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:58,002 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 184693649, now seen corresponding path program 1 times [2019-09-10 06:28:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:58,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:58,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:58,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:58,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:58,283 INFO L87 Difference]: Start difference. First operand 4306 states and 7240 transitions. Second operand 3 states. [2019-09-10 06:28:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:58,385 INFO L93 Difference]: Finished difference Result 5964 states and 9991 transitions. [2019-09-10 06:28:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:58,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 06:28:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:58,425 INFO L225 Difference]: With dead ends: 5964 [2019-09-10 06:28:58,425 INFO L226 Difference]: Without dead ends: 5964 [2019-09-10 06:28:58,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-09-10 06:28:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5962. [2019-09-10 06:28:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5962 states. [2019-09-10 06:28:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 9990 transitions. [2019-09-10 06:28:58,616 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 9990 transitions. Word has length 204 [2019-09-10 06:28:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:58,618 INFO L475 AbstractCegarLoop]: Abstraction has 5962 states and 9990 transitions. [2019-09-10 06:28:58,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 9990 transitions. [2019-09-10 06:28:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 06:28:58,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:58,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:58,630 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash 435283910, now seen corresponding path program 1 times [2019-09-10 06:28:58,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:58,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:58,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:58,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:58,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:58,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:58,917 INFO L87 Difference]: Start difference. First operand 5962 states and 9990 transitions. Second operand 3 states. [2019-09-10 06:28:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:59,021 INFO L93 Difference]: Finished difference Result 10848 states and 17995 transitions. [2019-09-10 06:28:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 06:28:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:59,077 INFO L225 Difference]: With dead ends: 10848 [2019-09-10 06:28:59,077 INFO L226 Difference]: Without dead ends: 10848 [2019-09-10 06:28:59,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10848 states. [2019-09-10 06:28:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10848 to 10846. [2019-09-10 06:28:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10846 states. [2019-09-10 06:28:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 17994 transitions. [2019-09-10 06:28:59,348 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 17994 transitions. Word has length 204 [2019-09-10 06:28:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:59,349 INFO L475 AbstractCegarLoop]: Abstraction has 10846 states and 17994 transitions. [2019-09-10 06:28:59,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 17994 transitions. [2019-09-10 06:28:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:28:59,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:59,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:59,358 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:59,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash 696486883, now seen corresponding path program 1 times [2019-09-10 06:28:59,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:59,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:59,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:59,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:28:59,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:59,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:28:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:28:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:28:59,839 INFO L87 Difference]: Start difference. First operand 10846 states and 17994 transitions. Second operand 7 states. [2019-09-10 06:29:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:00,982 INFO L93 Difference]: Finished difference Result 61951 states and 103018 transitions. [2019-09-10 06:29:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:29:00,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-09-10 06:29:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:01,183 INFO L225 Difference]: With dead ends: 61951 [2019-09-10 06:29:01,184 INFO L226 Difference]: Without dead ends: 61951 [2019-09-10 06:29:01,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:29:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61951 states. [2019-09-10 06:29:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61951 to 20941. [2019-09-10 06:29:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20941 states. [2019-09-10 06:29:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20941 states to 20941 states and 34578 transitions. [2019-09-10 06:29:02,005 INFO L78 Accepts]: Start accepts. Automaton has 20941 states and 34578 transitions. Word has length 208 [2019-09-10 06:29:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:02,006 INFO L475 AbstractCegarLoop]: Abstraction has 20941 states and 34578 transitions. [2019-09-10 06:29:02,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20941 states and 34578 transitions. [2019-09-10 06:29:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 06:29:02,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:02,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:02,013 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 45530812, now seen corresponding path program 1 times [2019-09-10 06:29:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:02,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:02,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:02,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:02,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:02,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:02,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:02,318 INFO L87 Difference]: Start difference. First operand 20941 states and 34578 transitions. Second operand 4 states. [2019-09-10 06:29:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:02,583 INFO L93 Difference]: Finished difference Result 36669 states and 60815 transitions. [2019-09-10 06:29:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:02,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-09-10 06:29:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:02,672 INFO L225 Difference]: With dead ends: 36669 [2019-09-10 06:29:02,672 INFO L226 Difference]: Without dead ends: 36669 [2019-09-10 06:29:02,673 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 06:29:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-09-10 06:29:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 31420. [2019-09-10 06:29:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31420 states. [2019-09-10 06:29:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31420 states to 31420 states and 51964 transitions. [2019-09-10 06:29:03,361 INFO L78 Accepts]: Start accepts. Automaton has 31420 states and 51964 transitions. Word has length 209 [2019-09-10 06:29:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:03,362 INFO L475 AbstractCegarLoop]: Abstraction has 31420 states and 51964 transitions. [2019-09-10 06:29:03,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31420 states and 51964 transitions. [2019-09-10 06:29:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 06:29:03,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:03,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:03,369 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1124343866, now seen corresponding path program 1 times [2019-09-10 06:29:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:03,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:03,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:03,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:03,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:03,550 INFO L87 Difference]: Start difference. First operand 31420 states and 51964 transitions. Second operand 3 states. [2019-09-10 06:29:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:03,728 INFO L93 Difference]: Finished difference Result 44126 states and 72853 transitions. [2019-09-10 06:29:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:03,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-10 06:29:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:03,854 INFO L225 Difference]: With dead ends: 44126 [2019-09-10 06:29:03,854 INFO L226 Difference]: Without dead ends: 44126 [2019-09-10 06:29:03,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44126 states. [2019-09-10 06:29:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44126 to 44124. [2019-09-10 06:29:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44124 states. [2019-09-10 06:29:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44124 states to 44124 states and 72852 transitions. [2019-09-10 06:29:05,540 INFO L78 Accepts]: Start accepts. Automaton has 44124 states and 72852 transitions. Word has length 209 [2019-09-10 06:29:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:05,541 INFO L475 AbstractCegarLoop]: Abstraction has 44124 states and 72852 transitions. [2019-09-10 06:29:05,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 44124 states and 72852 transitions. [2019-09-10 06:29:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 06:29:05,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:05,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:05,548 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1021288442, now seen corresponding path program 1 times [2019-09-10 06:29:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:05,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:05,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:05,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:05,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:05,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:05,735 INFO L87 Difference]: Start difference. First operand 44124 states and 72852 transitions. Second operand 3 states. [2019-09-10 06:29:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:05,940 INFO L93 Difference]: Finished difference Result 61162 states and 100870 transitions. [2019-09-10 06:29:05,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:05,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-10 06:29:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:06,118 INFO L225 Difference]: With dead ends: 61162 [2019-09-10 06:29:06,118 INFO L226 Difference]: Without dead ends: 61162 [2019-09-10 06:29:06,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61162 states. [2019-09-10 06:29:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61162 to 61160. [2019-09-10 06:29:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61160 states. [2019-09-10 06:29:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61160 states to 61160 states and 100869 transitions. [2019-09-10 06:29:08,026 INFO L78 Accepts]: Start accepts. Automaton has 61160 states and 100869 transitions. Word has length 209 [2019-09-10 06:29:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:08,027 INFO L475 AbstractCegarLoop]: Abstraction has 61160 states and 100869 transitions. [2019-09-10 06:29:08,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61160 states and 100869 transitions. [2019-09-10 06:29:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 06:29:08,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:08,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:08,036 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash 15921222, now seen corresponding path program 1 times [2019-09-10 06:29:08,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:08,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:08,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:08,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:08,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:08,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,292 INFO L87 Difference]: Start difference. First operand 61160 states and 100869 transitions. Second operand 3 states. [2019-09-10 06:29:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:08,637 INFO L93 Difference]: Finished difference Result 92040 states and 151921 transitions. [2019-09-10 06:29:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:08,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-10 06:29:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:08,802 INFO L225 Difference]: With dead ends: 92040 [2019-09-10 06:29:08,802 INFO L226 Difference]: Without dead ends: 92040 [2019-09-10 06:29:08,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92040 states. [2019-09-10 06:29:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92040 to 92038. [2019-09-10 06:29:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92038 states. [2019-09-10 06:29:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92038 states to 92038 states and 151920 transitions. [2019-09-10 06:29:11,808 INFO L78 Accepts]: Start accepts. Automaton has 92038 states and 151920 transitions. Word has length 209 [2019-09-10 06:29:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:11,809 INFO L475 AbstractCegarLoop]: Abstraction has 92038 states and 151920 transitions. [2019-09-10 06:29:11,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 92038 states and 151920 transitions. [2019-09-10 06:29:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 06:29:11,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:11,817 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:11,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:11,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1345287114, now seen corresponding path program 1 times [2019-09-10 06:29:11,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:11,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:12,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:12,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:12,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:12,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:12,114 INFO L87 Difference]: Start difference. First operand 92038 states and 151920 transitions. Second operand 4 states. [2019-09-10 06:29:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:12,756 INFO L93 Difference]: Finished difference Result 180883 states and 298678 transitions. [2019-09-10 06:29:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:12,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 06:29:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:15,282 INFO L225 Difference]: With dead ends: 180883 [2019-09-10 06:29:15,282 INFO L226 Difference]: Without dead ends: 180883 [2019-09-10 06:29:15,283 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 06:29:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180883 states. [2019-09-10 06:29:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180883 to 151244. [2019-09-10 06:29:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151244 states. [2019-09-10 06:29:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151244 states to 151244 states and 249190 transitions. [2019-09-10 06:29:17,336 INFO L78 Accepts]: Start accepts. Automaton has 151244 states and 249190 transitions. Word has length 210 [2019-09-10 06:29:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:17,337 INFO L475 AbstractCegarLoop]: Abstraction has 151244 states and 249190 transitions. [2019-09-10 06:29:17,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 151244 states and 249190 transitions. [2019-09-10 06:29:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 06:29:17,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:17,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:17,341 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1307382461, now seen corresponding path program 1 times [2019-09-10 06:29:17,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:17,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:17,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:17,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:17,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:17,562 INFO L87 Difference]: Start difference. First operand 151244 states and 249190 transitions. Second operand 4 states. [2019-09-10 06:29:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:18,650 INFO L93 Difference]: Finished difference Result 296235 states and 488328 transitions. [2019-09-10 06:29:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:18,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-09-10 06:29:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:19,228 INFO L225 Difference]: With dead ends: 296235 [2019-09-10 06:29:19,229 INFO L226 Difference]: Without dead ends: 296235 [2019-09-10 06:29:19,230 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 06:29:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296235 states. [2019-09-10 06:29:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296235 to 248174. [2019-09-10 06:29:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248174 states. [2019-09-10 06:29:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248174 states to 248174 states and 408172 transitions. [2019-09-10 06:29:25,952 INFO L78 Accepts]: Start accepts. Automaton has 248174 states and 408172 transitions. Word has length 211 [2019-09-10 06:29:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:25,953 INFO L475 AbstractCegarLoop]: Abstraction has 248174 states and 408172 transitions. [2019-09-10 06:29:25,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 248174 states and 408172 transitions. [2019-09-10 06:29:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 06:29:25,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:25,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:25,957 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1931202639, now seen corresponding path program 1 times [2019-09-10 06:29:25,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:25,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:26,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:26,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:26,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:26,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:26,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:26,208 INFO L87 Difference]: Start difference. First operand 248174 states and 408172 transitions. Second operand 4 states. [2019-09-10 06:29:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:31,111 INFO L93 Difference]: Finished difference Result 488652 states and 804045 transitions. [2019-09-10 06:29:31,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:31,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-10 06:29:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:31,809 INFO L225 Difference]: With dead ends: 488652 [2019-09-10 06:29:31,809 INFO L226 Difference]: Without dead ends: 488652 [2019-09-10 06:29:31,809 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 06:29:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488652 states. [2019-09-10 06:29:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488652 to 405700. [2019-09-10 06:29:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405700 states. [2019-09-10 06:29:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405700 states to 405700 states and 666122 transitions. [2019-09-10 06:29:43,747 INFO L78 Accepts]: Start accepts. Automaton has 405700 states and 666122 transitions. Word has length 212 [2019-09-10 06:29:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:43,747 INFO L475 AbstractCegarLoop]: Abstraction has 405700 states and 666122 transitions. [2019-09-10 06:29:43,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 405700 states and 666122 transitions. [2019-09-10 06:29:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 06:29:43,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:43,751 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash 209766346, now seen corresponding path program 1 times [2019-09-10 06:29:43,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:43,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:43,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:44,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:44,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:29:44,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:44,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:29:44,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:29:44,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:29:44,021 INFO L87 Difference]: Start difference. First operand 405700 states and 666122 transitions. Second operand 8 states. [2019-09-10 06:29:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:56,499 INFO L93 Difference]: Finished difference Result 1832127 states and 3010941 transitions. [2019-09-10 06:29:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:29:56,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-10 06:29:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:01,429 INFO L225 Difference]: With dead ends: 1832127 [2019-09-10 06:30:01,430 INFO L226 Difference]: Without dead ends: 1832127 [2019-09-10 06:30:01,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:30:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832127 states. [2019-09-10 06:30:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832127 to 1110402. [2019-09-10 06:30:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110402 states. [2019-09-10 06:31:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110402 states to 1110402 states and 1815816 transitions. [2019-09-10 06:31:01,625 INFO L78 Accepts]: Start accepts. Automaton has 1110402 states and 1815816 transitions. Word has length 213 [2019-09-10 06:31:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:01,625 INFO L475 AbstractCegarLoop]: Abstraction has 1110402 states and 1815816 transitions. [2019-09-10 06:31:01,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:31:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1110402 states and 1815816 transitions. [2019-09-10 06:31:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 06:31:01,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:01,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:31:01,629 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1767626310, now seen corresponding path program 1 times [2019-09-10 06:31:01,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:01,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:01,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:01,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:02,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:02,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:31:02,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:02,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:31:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:31:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:31:02,170 INFO L87 Difference]: Start difference. First operand 1110402 states and 1815816 transitions. Second operand 7 states. [2019-09-10 06:31:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:19,938 INFO L93 Difference]: Finished difference Result 1576862 states and 2580601 transitions. [2019-09-10 06:31:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:31:19,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2019-09-10 06:31:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:22,407 INFO L225 Difference]: With dead ends: 1576862 [2019-09-10 06:31:22,407 INFO L226 Difference]: Without dead ends: 1576862 [2019-09-10 06:31:22,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:31:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576862 states. [2019-09-10 06:32:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576862 to 1110402. [2019-09-10 06:32:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110402 states. [2019-09-10 06:32:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110402 states to 1110402 states and 1812691 transitions. [2019-09-10 06:32:06,897 INFO L78 Accepts]: Start accepts. Automaton has 1110402 states and 1812691 transitions. Word has length 215 [2019-09-10 06:32:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:06,897 INFO L475 AbstractCegarLoop]: Abstraction has 1110402 states and 1812691 transitions. [2019-09-10 06:32:06,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:32:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1110402 states and 1812691 transitions. [2019-09-10 06:32:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 06:32:06,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:06,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:32:06,901 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -810466462, now seen corresponding path program 1 times [2019-09-10 06:32:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:06,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:07,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:32:07,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:07,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:32:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:32:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:32:07,399 INFO L87 Difference]: Start difference. First operand 1110402 states and 1812691 transitions. Second operand 7 states. [2019-09-10 06:32:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:33,548 INFO L93 Difference]: Finished difference Result 2691933 states and 4398340 transitions. [2019-09-10 06:32:33,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:32:33,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-09-10 06:32:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:40,470 INFO L225 Difference]: With dead ends: 2691933 [2019-09-10 06:32:40,470 INFO L226 Difference]: Without dead ends: 2691933 [2019-09-10 06:32:40,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:32:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691933 states.