java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:16:48,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:16:48,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:16:48,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:16:48,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:16:48,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:16:48,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:16:48,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:16:48,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:16:48,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:16:48,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:16:48,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:16:48,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:16:48,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:16:48,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:16:48,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:16:48,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:16:48,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:16:48,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:16:48,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:16:48,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:16:48,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:16:48,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:16:48,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:16:48,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:16:48,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:16:48,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:16:48,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:16:48,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:16:48,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:16:48,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:16:48,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:16:48,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:16:48,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:16:48,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:16:48,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:16:48,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:16:48,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:16:48,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:16:48,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:16:48,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:16:48,898 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:16:48,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:16:48,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:16:48,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:16:48,913 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:16:48,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:16:48,914 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:16:48,914 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:16:48,914 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:16:48,914 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:16:48,915 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:16:48,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:16:48,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:16:48,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:16:48,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:16:48,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:16:48,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:16:48,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:16:48,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:16:48,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:16:48,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:16:48,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:16:48,917 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:16:48,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:16:48,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:16:48,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:16:48,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:16:48,918 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:16:48,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:16:48,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:16:48,919 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:16:48,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:16:48,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:16:48,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:16:48,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:16:48,968 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:16:48,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:16:49,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b8ab1f7/914e56f066d9469cbf0151a5308fa60d/FLAGedcb0bfba [2019-09-10 06:16:49,598 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:16:49,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:16:49,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b8ab1f7/914e56f066d9469cbf0151a5308fa60d/FLAGedcb0bfba [2019-09-10 06:16:49,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b8ab1f7/914e56f066d9469cbf0151a5308fa60d [2019-09-10 06:16:49,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:16:49,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:16:49,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:16:49,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:16:49,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:16:49,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:16:49" (1/1) ... [2019-09-10 06:16:49,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b03c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:49, skipping insertion in model container [2019-09-10 06:16:49,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:16:49" (1/1) ... [2019-09-10 06:16:49,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:16:49,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:16:50,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:16:50,480 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:16:50,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:16:50,656 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:16:50,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50 WrapperNode [2019-09-10 06:16:50,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:16:50,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:16:50,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:16:50,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:16:50,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (1/1) ... [2019-09-10 06:16:50,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:16:50,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:16:50,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:16:50,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:16:50,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (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:16:50,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:16:50,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:16:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:16:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:16:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:16:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:16:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:16:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:16:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:16:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:16:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:16:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:16:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:16:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:16:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:16:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:16:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:16:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:16:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:16:52,445 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:16:52,446 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:16:52,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:16:52 BoogieIcfgContainer [2019-09-10 06:16:52,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:16:52,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:16:52,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:16:52,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:16:52,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:16:49" (1/3) ... [2019-09-10 06:16:52,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ad773f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:16:52, skipping insertion in model container [2019-09-10 06:16:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:16:50" (2/3) ... [2019-09-10 06:16:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ad773f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:16:52, skipping insertion in model container [2019-09-10 06:16:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:16:52" (3/3) ... [2019-09-10 06:16:52,461 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:16:52,473 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:16:52,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:16:52,525 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:16:52,558 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:16:52,559 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:16:52,559 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:16:52,559 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:16:52,559 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:16:52,559 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:16:52,560 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:16:52,560 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:16:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-10 06:16:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:16:52,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:52,642 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] [2019-09-10 06:16:52,644 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-10 06:16:52,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:52,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:53,377 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:16:53,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:53,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:53,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:53,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:53,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:53,406 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-10 06:16:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:53,522 INFO L93 Difference]: Finished difference Result 444 states and 770 transitions. [2019-09-10 06:16:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:53,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:16:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:53,543 INFO L225 Difference]: With dead ends: 444 [2019-09-10 06:16:53,544 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 06:16:53,546 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:16:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 06:16:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-10 06:16:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 06:16:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-10 06:16:53,635 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-10 06:16:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:53,637 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-10 06:16:53,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-10 06:16:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:16:53,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:53,640 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] [2019-09-10 06:16:53,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-10 06:16:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:53,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:53,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:53,934 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:16:53,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:53,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:53,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:53,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:53,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:53,939 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-10 06:16:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:53,983 INFO L93 Difference]: Finished difference Result 537 states and 891 transitions. [2019-09-10 06:16:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:53,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:16:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:53,991 INFO L225 Difference]: With dead ends: 537 [2019-09-10 06:16:53,992 INFO L226 Difference]: Without dead ends: 537 [2019-09-10 06:16:53,993 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:16:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-10 06:16:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-10 06:16:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-10 06:16:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-10 06:16:54,034 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-10 06:16:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:54,035 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-10 06:16:54,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-10 06:16:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:16:54,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,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] [2019-09-10 06:16:54,037 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-10 06:16:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,186 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:16:54,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:54,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:54,188 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-10 06:16:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:54,219 INFO L93 Difference]: Finished difference Result 848 states and 1411 transitions. [2019-09-10 06:16:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:54,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:16:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:54,225 INFO L225 Difference]: With dead ends: 848 [2019-09-10 06:16:54,225 INFO L226 Difference]: Without dead ends: 848 [2019-09-10 06:16:54,226 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:16:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-10 06:16:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-10 06:16:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-10 06:16:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-10 06:16:54,250 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-10 06:16:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:54,251 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-10 06:16:54,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-10 06:16:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:16:54,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,253 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] [2019-09-10 06:16:54,254 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-10 06:16:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,368 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:16:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:54,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:54,371 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-10 06:16:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:54,403 INFO L93 Difference]: Finished difference Result 1126 states and 1877 transitions. [2019-09-10 06:16:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:54,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:16:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:54,411 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 06:16:54,411 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 06:16:54,411 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:16:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 06:16:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-10 06:16:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-10 06:16:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-10 06:16:54,496 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-10 06:16:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:54,496 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-10 06:16:54,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-10 06:16:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:16:54,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,498 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] [2019-09-10 06:16:54,499 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-10 06:16:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,607 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:16:54,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:54,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:54,609 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-10 06:16:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:54,647 INFO L93 Difference]: Finished difference Result 1954 states and 3248 transitions. [2019-09-10 06:16:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:54,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:16:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:54,659 INFO L225 Difference]: With dead ends: 1954 [2019-09-10 06:16:54,659 INFO L226 Difference]: Without dead ends: 1954 [2019-09-10 06:16:54,660 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:16:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-10 06:16:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-10 06:16:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 06:16:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-10 06:16:54,726 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-10 06:16:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:54,727 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-10 06:16:54,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-10 06:16:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:16:54,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,731 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] [2019-09-10 06:16:54,732 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-10 06:16:54,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,869 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:16:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:54,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:54,872 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-10 06:16:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:54,927 INFO L93 Difference]: Finished difference Result 2647 states and 4403 transitions. [2019-09-10 06:16:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:54,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:16:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:54,945 INFO L225 Difference]: With dead ends: 2647 [2019-09-10 06:16:54,945 INFO L226 Difference]: Without dead ends: 2647 [2019-09-10 06:16:54,946 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:16:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-10 06:16:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-10 06:16:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-10 06:16:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-10 06:16:55,037 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-10 06:16:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:55,037 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-10 06:16:55,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-10 06:16:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:16:55,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:55,040 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] [2019-09-10 06:16:55,041 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-10 06:16:55,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:55,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:55,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:55,225 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:16:55,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:55,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:55,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:55,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:55,228 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-10 06:16:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:55,291 INFO L93 Difference]: Finished difference Result 4816 states and 7949 transitions. [2019-09-10 06:16:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:55,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:16:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:55,318 INFO L225 Difference]: With dead ends: 4816 [2019-09-10 06:16:55,319 INFO L226 Difference]: Without dead ends: 4816 [2019-09-10 06:16:55,319 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:16:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-10 06:16:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-10 06:16:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-10 06:16:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-10 06:16:55,440 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-10 06:16:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:55,441 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-10 06:16:55,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-10 06:16:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:16:55,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:55,443 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] [2019-09-10 06:16:55,443 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-10 06:16:55,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:55,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:55,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:55,697 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:16:55,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:16:55,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:55,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:16:55,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:16:55,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:16:55,699 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-10 06:16:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:56,478 INFO L93 Difference]: Finished difference Result 24302 states and 40369 transitions. [2019-09-10 06:16:56,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:16:56,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 06:16:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:56,609 INFO L225 Difference]: With dead ends: 24302 [2019-09-10 06:16:56,609 INFO L226 Difference]: Without dead ends: 24302 [2019-09-10 06:16:56,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:16:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-10 06:16:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-10 06:16:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-10 06:16:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-10 06:16:57,012 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-10 06:16:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:57,013 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-10 06:16:57,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:16:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-10 06:16:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:16:57,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:57,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:57,016 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-10 06:16:57,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:57,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:57,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:57,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:57,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:57,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:57,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:57,205 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-10 06:16:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:57,435 INFO L93 Difference]: Finished difference Result 18232 states and 30131 transitions. [2019-09-10 06:16:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:57,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:16:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:57,479 INFO L225 Difference]: With dead ends: 18232 [2019-09-10 06:16:57,479 INFO L226 Difference]: Without dead ends: 18232 [2019-09-10 06:16:57,481 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:16:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-10 06:16:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-10 06:16:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-10 06:16:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-10 06:16:57,766 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-10 06:16:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:57,767 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-10 06:16:57,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-10 06:16:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:16:57,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:57,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:57,769 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:57,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-10 06:16:57,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:57,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:57,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:57,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:57,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:57,892 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:16:57,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:57,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:16:57,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:57,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:16:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:16:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:57,897 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-10 06:16:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:58,008 INFO L93 Difference]: Finished difference Result 20841 states and 34254 transitions. [2019-09-10 06:16:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:58,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 06:16:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:58,069 INFO L225 Difference]: With dead ends: 20841 [2019-09-10 06:16:58,070 INFO L226 Difference]: Without dead ends: 20841 [2019-09-10 06:16:58,072 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:16:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-10 06:16:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-10 06:16:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-10 06:16:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-10 06:16:58,585 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-10 06:16:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:58,586 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-10 06:16:58,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-10 06:16:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:16:58,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:58,588 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] [2019-09-10 06:16:58,588 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-10 06:16:58,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:58,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:58,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:58,708 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:16:58,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:58,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:58,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:58,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:58,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:58,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:58,710 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-10 06:16:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:58,956 INFO L93 Difference]: Finished difference Result 40351 states and 66359 transitions. [2019-09-10 06:16:58,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:58,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:16:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:59,074 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 06:16:59,075 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 06:16:59,076 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:16:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 06:17:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-10 06:17:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-10 06:17:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-10 06:17:00,364 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-10 06:17:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:00,365 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-10 06:17:00,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-10 06:17:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:17:00,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:00,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] [2019-09-10 06:17:00,368 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:00,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-10 06:17:00,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:00,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:00,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:00,549 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:17:00,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:00,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:17:00,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:00,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:17:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:17:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:17:00,553 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-10 06:17:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:00,892 INFO L93 Difference]: Finished difference Result 64914 states and 106473 transitions. [2019-09-10 06:17:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:17:00,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:17:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:01,105 INFO L225 Difference]: With dead ends: 64914 [2019-09-10 06:17:01,105 INFO L226 Difference]: Without dead ends: 64914 [2019-09-10 06:17:01,105 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:17:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-10 06:17:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-10 06:17:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-10 06:17:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-10 06:17:03,535 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-10 06:17:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:03,535 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-10 06:17:03,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-10 06:17:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 06:17:03,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:03,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:03,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-10 06:17:03,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:03,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:03,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:03,697 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:17:03,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:03,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:17:03,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:03,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:17:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:17:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:17:03,699 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-10 06:17:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:04,809 INFO L93 Difference]: Finished difference Result 212252 states and 346491 transitions. [2019-09-10 06:17:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:17:04,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-10 06:17:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:05,201 INFO L225 Difference]: With dead ends: 212252 [2019-09-10 06:17:05,202 INFO L226 Difference]: Without dead ends: 212252 [2019-09-10 06:17:05,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:17:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-10 06:17:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-10 06:17:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:17:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-10 06:17:09,604 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-10 06:17:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:09,604 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-10 06:17:09,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:17:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-10 06:17:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 06:17:09,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:09,613 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] [2019-09-10 06:17:09,613 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-10 06:17:09,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:09,952 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:17:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:17:09,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:09,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:17:09,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:17:09,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:17:09,954 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-10 06:17:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:10,845 INFO L93 Difference]: Finished difference Result 205422 states and 333953 transitions. [2019-09-10 06:17:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:17:10,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 06:17:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:11,205 INFO L225 Difference]: With dead ends: 205422 [2019-09-10 06:17:11,206 INFO L226 Difference]: Without dead ends: 205422 [2019-09-10 06:17:11,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:17:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-10 06:17:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-10 06:17:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:17:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-10 06:17:16,087 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-10 06:17:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:16,087 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-10 06:17:16,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:17:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-10 06:17:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:17:16,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:16,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:16,089 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-10 06:17:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:16,343 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:17:16,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:17:16,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:16,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:17:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:17:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:17:16,345 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-10 06:17:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:17,382 INFO L93 Difference]: Finished difference Result 287801 states and 465957 transitions. [2019-09-10 06:17:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:17:17,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 06:17:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:17,782 INFO L225 Difference]: With dead ends: 287801 [2019-09-10 06:17:17,784 INFO L226 Difference]: Without dead ends: 287801 [2019-09-10 06:17:17,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:17:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-10 06:17:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-10 06:17:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-10 06:17:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-10 06:17:24,233 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-10 06:17:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:24,234 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-10 06:17:24,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:17:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-10 06:17:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:17:24,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:24,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:24,235 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-10 06:17:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:24,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:24,370 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:17:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:17:24,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:24,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:17:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:17:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:17:24,372 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-10 06:17:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:30,572 INFO L93 Difference]: Finished difference Result 473703 states and 760804 transitions. [2019-09-10 06:17:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:17:30,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 06:17:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:31,392 INFO L225 Difference]: With dead ends: 473703 [2019-09-10 06:17:31,392 INFO L226 Difference]: Without dead ends: 473703 [2019-09-10 06:17:31,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:17:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-10 06:17:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-10 06:17:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-10 06:17:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-10 06:17:36,071 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-10 06:17:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:36,072 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-10 06:17:36,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:17:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-10 06:17:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:17:36,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:36,086 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:36,087 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:36,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:36,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-10 06:17:36,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:36,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:37,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:17:37,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:17:37,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 06:17:37,344 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [256], [280], [283], [285], [289], [318], [322], [351], [386], [389], [392], [395], [398], [401], [408], [416], [418], [421], [422], [424], [433], [436], [447], [450], [462], [480], [483], [520], [528], [536], [544], [550], [554], [558], [562], [564], [567], [604], [612], [620], [628], [634], [638], [642], [646], [648], [651], [688], [696], [704], [712], [722], [726], [730], [732], [735], [772], [780], [788], [796], [1421], [1422], [1426], [1427], [1428] [2019-09-10 06:17:37,413 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:17:37,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:17:37,673 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:17:38,271 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:17:38,274 INFO L272 AbstractInterpreter]: Visited 155 different actions 436 times. Merged at 55 different actions 257 times. Widened at 11 different actions 15 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 281 variables. [2019-09-10 06:17:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:38,280 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:17:39,137 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 87.58% of their original sizes. [2019-09-10 06:17:39,137 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:18:14,926 INFO L420 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2019-09-10 06:18:14,926 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:18:14,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:18:14,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [114] imperfect sequences [5] total 117 [2019-09-10 06:18:14,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:14,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-10 06:18:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-10 06:18:14,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1689, Invalid=11193, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 06:18:14,934 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 114 states. [2019-09-10 06:23:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,350 INFO L93 Difference]: Finished difference Result 1405457 states and 2209778 transitions. [2019-09-10 06:23:07,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-10 06:23:07,350 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 167 [2019-09-10 06:23:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:10,209 INFO L225 Difference]: With dead ends: 1405457 [2019-09-10 06:23:10,210 INFO L226 Difference]: Without dead ends: 1405457 [2019-09-10 06:23:10,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16201 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=5828, Invalid=41478, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 06:23:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405457 states. [2019-09-10 06:23:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405457 to 498976. [2019-09-10 06:23:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498976 states. [2019-09-10 06:23:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498976 states to 498976 states and 800298 transitions. [2019-09-10 06:23:40,454 INFO L78 Accepts]: Start accepts. Automaton has 498976 states and 800298 transitions. Word has length 167 [2019-09-10 06:23:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:40,455 INFO L475 AbstractCegarLoop]: Abstraction has 498976 states and 800298 transitions. [2019-09-10 06:23:40,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-10 06:23:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 498976 states and 800298 transitions. [2019-09-10 06:23:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:40,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:40,478 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:40,478 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-10 06:23:40,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:40,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:40,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:23:40,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:40,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:40,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:40,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:40,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:40,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:40,915 INFO L87 Difference]: Start difference. First operand 498976 states and 800298 transitions. Second operand 4 states. [2019-09-10 06:23:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:46,064 INFO L93 Difference]: Finished difference Result 791377 states and 1272215 transitions. [2019-09-10 06:23:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:23:46,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:23:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:56,889 INFO L225 Difference]: With dead ends: 791377 [2019-09-10 06:23:56,890 INFO L226 Difference]: Without dead ends: 791377 [2019-09-10 06:23:56,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791377 states. [2019-09-10 06:24:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791377 to 701977. [2019-09-10 06:24:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701977 states. [2019-09-10 06:24:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701977 states to 701977 states and 1129209 transitions. [2019-09-10 06:24:18,199 INFO L78 Accepts]: Start accepts. Automaton has 701977 states and 1129209 transitions. Word has length 167 [2019-09-10 06:24:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:18,199 INFO L475 AbstractCegarLoop]: Abstraction has 701977 states and 1129209 transitions. [2019-09-10 06:24:18,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 701977 states and 1129209 transitions. [2019-09-10 06:24:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:24:18,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:18,214 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,214 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-10 06:24:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:24:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:18,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:18,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:18,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:18,400 INFO L87 Difference]: Start difference. First operand 701977 states and 1129209 transitions. Second operand 6 states. [2019-09-10 06:24:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:30,998 INFO L93 Difference]: Finished difference Result 869972 states and 1402219 transitions. [2019-09-10 06:24:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:30,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:24:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:32,465 INFO L225 Difference]: With dead ends: 869972 [2019-09-10 06:24:32,465 INFO L226 Difference]: Without dead ends: 869972 [2019-09-10 06:24:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869972 states. [2019-09-10 06:24:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869972 to 788654. [2019-09-10 06:24:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788654 states. [2019-09-10 06:25:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788654 states to 788654 states and 1268977 transitions. [2019-09-10 06:25:00,986 INFO L78 Accepts]: Start accepts. Automaton has 788654 states and 1268977 transitions. Word has length 167 [2019-09-10 06:25:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:00,986 INFO L475 AbstractCegarLoop]: Abstraction has 788654 states and 1268977 transitions. [2019-09-10 06:25:00,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:25:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 788654 states and 1268977 transitions. [2019-09-10 06:25:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:25:00,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:00,997 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:00,997 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1361288056, now seen corresponding path program 1 times [2019-09-10 06:25:00,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:00,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:01,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:25:01,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:25:01,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2019-09-10 06:25:01,171 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [256], [285], [289], [318], [322], [346], [349], [351], [386], [389], [392], [395], [398], [401], [408], [416], [418], [421], [422], [424], [433], [436], [447], [450], [462], [480], [483], [520], [528], [536], [544], [554], [558], [562], [564], [567], [604], [612], [620], [628], [634], [638], [642], [646], [648], [651], [688], [696], [704], [712], [718], [722], [726], [730], [732], [735], [772], [780], [788], [796], [1421], [1422], [1426], [1427], [1428] [2019-09-10 06:25:01,177 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:25:01,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:25:01,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:25:01,463 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:25:01,465 INFO L272 AbstractInterpreter]: Visited 155 different actions 395 times. Merged at 55 different actions 219 times. Widened at 16 different actions 17 times. Performed 1430 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 4 different actions. Largest state had 281 variables. [2019-09-10 06:25:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:01,466 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:25:03,674 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 87.46% of their original sizes. [2019-09-10 06:25:03,674 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:25:43,731 INFO L420 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2019-09-10 06:25:43,731 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:25:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:25:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [116] imperfect sequences [5] total 119 [2019-09-10 06:25:43,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:43,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-10 06:25:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-10 06:25:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=11580, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 06:25:43,735 INFO L87 Difference]: Start difference. First operand 788654 states and 1268977 transitions. Second operand 116 states.