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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:27:38,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:27:38,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:27:38,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:27:38,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:27:38,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:27:38,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:27:38,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:27:38,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:27:38,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:27:38,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:27:38,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:27:38,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:27:38,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:27:38,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:27:38,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:27:38,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:27:38,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:27:38,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:27:38,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:27:38,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:27:38,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:27:38,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:27:38,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:27:38,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:27:38,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:27:38,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:27:38,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:27:38,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:27:38,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:27:38,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:27:38,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:27:38,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:27:38,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:27:38,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:27:38,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:27:38,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:27:38,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:27:38,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:27:38,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:27:38,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:27:38,978 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:27:38,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:27:38,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:27:38,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:27:38,996 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:27:38,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:27:38,997 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:27:38,997 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:27:38,997 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:27:38,997 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:27:38,997 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:27:38,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:27:38,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:27:38,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:27:38,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:27:38,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:27:38,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:27:38,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:27:38,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:27:39,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:27:39,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:27:39,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:27:39,000 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:27:39,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:27:39,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:27:39,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:27:39,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:27:39,001 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:27:39,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:27:39,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:27:39,002 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:27:39,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:27:39,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:27:39,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:27:39,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:27:39,048 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:27:39,049 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:27:39,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ddf07fb/7353966a5d9f4c6c95c53470b1acd940/FLAGb3e6f6c00 [2019-09-10 06:27:39,671 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:27:39,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:27:39,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ddf07fb/7353966a5d9f4c6c95c53470b1acd940/FLAGb3e6f6c00 [2019-09-10 06:27:39,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ddf07fb/7353966a5d9f4c6c95c53470b1acd940 [2019-09-10 06:27:39,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:27:39,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:27:39,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:27:39,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:27:39,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:27:39,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:27:39" (1/1) ... [2019-09-10 06:27:39,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d390f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:39, skipping insertion in model container [2019-09-10 06:27:39,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:27:39" (1/1) ... [2019-09-10 06:27:39,993 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:27:40,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:27:40,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:27:40,641 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:27:40,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:27:40,822 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:27:40,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40 WrapperNode [2019-09-10 06:27:40,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:27:40,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:27:40,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:27:40,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:27:40,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (1/1) ... [2019-09-10 06:27:40,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:27:40,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:27:40,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:27:40,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:27:40,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (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:27:41,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:27:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:27:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:27:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:27:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:27:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:27:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:27:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:27:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:27:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:27:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:27:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:27:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:27:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:27:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:27:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:27:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:27:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:27:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:27:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:27:42,347 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:27:42,348 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:27:42,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:27:42 BoogieIcfgContainer [2019-09-10 06:27:42,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:27:42,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:27:42,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:27:42,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:27:42,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:27:39" (1/3) ... [2019-09-10 06:27:42,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3757d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:27:42, skipping insertion in model container [2019-09-10 06:27:42,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:40" (2/3) ... [2019-09-10 06:27:42,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3757d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:27:42, skipping insertion in model container [2019-09-10 06:27:42,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:27:42" (3/3) ... [2019-09-10 06:27:42,358 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:27:42,369 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:27:42,378 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:27:42,397 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:27:42,425 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:27:42,425 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:27:42,425 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:27:42,426 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:27:42,426 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:27:42,426 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:27:42,426 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:27:42,427 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:27:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-10 06:27:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:27:42,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:42,515 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] [2019-09-10 06:27:42,517 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-10 06:27:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:42,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:43,265 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:27:43,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:43,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:43,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:43,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:43,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:43,294 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-10 06:27:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:43,444 INFO L93 Difference]: Finished difference Result 458 states and 789 transitions. [2019-09-10 06:27:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:43,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:27:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:43,476 INFO L225 Difference]: With dead ends: 458 [2019-09-10 06:27:43,476 INFO L226 Difference]: Without dead ends: 450 [2019-09-10 06:27:43,479 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:27:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-10 06:27:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-10 06:27:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 06:27:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-10 06:27:43,585 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-10 06:27:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:43,586 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-10 06:27:43,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-10 06:27:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:27:43,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:43,589 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] [2019-09-10 06:27:43,589 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-10 06:27:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:43,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:43,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:43,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:43,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:43,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:43,811 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-10 06:27:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:43,854 INFO L93 Difference]: Finished difference Result 683 states and 1125 transitions. [2019-09-10 06:27:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:43,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:27:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:43,860 INFO L225 Difference]: With dead ends: 683 [2019-09-10 06:27:43,861 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 06:27:43,861 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:27:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 06:27:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-10 06:27:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 06:27:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-10 06:27:43,887 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-10 06:27:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:43,888 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-10 06:27:43,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-10 06:27:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:27:43,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:43,891 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] [2019-09-10 06:27:43,891 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-10 06:27:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:43,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:44,025 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:27:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:44,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:44,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:44,028 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-10 06:27:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:44,069 INFO L93 Difference]: Finished difference Result 1129 states and 1855 transitions. [2019-09-10 06:27:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:44,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:27:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:44,076 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 06:27:44,077 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 06:27:44,077 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:27:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 06:27:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-10 06:27:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-10 06:27:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-10 06:27:44,108 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-10 06:27:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:44,108 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-10 06:27:44,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-10 06:27:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:27:44,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:44,111 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] [2019-09-10 06:27:44,111 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-10 06:27:44,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:44,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:44,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:44,258 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:27:44,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:44,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:44,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:44,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:44,260 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-10 06:27:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:44,310 INFO L93 Difference]: Finished difference Result 1981 states and 3235 transitions. [2019-09-10 06:27:44,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:44,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 06:27:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:44,321 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 06:27:44,322 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 06:27:44,322 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:27:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 06:27:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-10 06:27:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-10 06:27:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-10 06:27:44,370 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-10 06:27:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:44,370 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-10 06:27:44,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-10 06:27:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:27:44,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:44,373 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] [2019-09-10 06:27:44,373 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-10 06:27:44,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:44,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:44,503 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:27:44,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:44,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:44,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:44,505 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-10 06:27:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:44,908 INFO L93 Difference]: Finished difference Result 8449 states and 13925 transitions. [2019-09-10 06:27:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:27:44,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 06:27:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:44,953 INFO L225 Difference]: With dead ends: 8449 [2019-09-10 06:27:44,953 INFO L226 Difference]: Without dead ends: 8449 [2019-09-10 06:27:44,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:27:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-10 06:27:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-10 06:27:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-10 06:27:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-10 06:27:45,215 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-10 06:27:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:45,216 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-10 06:27:45,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:27:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-10 06:27:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:27:45,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:45,222 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:27:45,222 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-10 06:27:45,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:45,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:45,543 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:27:45,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:45,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:45,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:45,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:45,546 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-10 06:27:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:45,692 INFO L93 Difference]: Finished difference Result 7275 states and 11987 transitions. [2019-09-10 06:27:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:45,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 06:27:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:45,732 INFO L225 Difference]: With dead ends: 7275 [2019-09-10 06:27:45,733 INFO L226 Difference]: Without dead ends: 7275 [2019-09-10 06:27:45,733 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:27:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-10 06:27:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-10 06:27:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-10 06:27:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-10 06:27:45,895 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-10 06:27:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:45,896 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-10 06:27:45,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-10 06:27:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:27:45,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:45,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:45,901 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-10 06:27:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:46,092 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:27:46,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:46,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:46,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:46,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:46,095 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-10 06:27:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:46,314 INFO L93 Difference]: Finished difference Result 10590 states and 17419 transitions. [2019-09-10 06:27:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:46,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:27:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:46,382 INFO L225 Difference]: With dead ends: 10590 [2019-09-10 06:27:46,382 INFO L226 Difference]: Without dead ends: 10590 [2019-09-10 06:27:46,383 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:27:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-10 06:27:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-10 06:27:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-10 06:27:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-10 06:27:46,646 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-10 06:27:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:46,647 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-10 06:27:46,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-10 06:27:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:27:46,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:46,653 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:27:46,653 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-10 06:27:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:46,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:46,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:46,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:46,762 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:27:46,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:46,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:46,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:46,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:46,764 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-10 06:27:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:46,855 INFO L93 Difference]: Finished difference Result 12121 states and 19845 transitions. [2019-09-10 06:27:46,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:46,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:27:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:46,904 INFO L225 Difference]: With dead ends: 12121 [2019-09-10 06:27:46,905 INFO L226 Difference]: Without dead ends: 12121 [2019-09-10 06:27:46,905 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:27:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-10 06:27:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-10 06:27:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-10 06:27:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-10 06:27:47,338 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-10 06:27:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:47,339 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-10 06:27:47,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-10 06:27:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:27:47,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:47,344 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:27:47,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-10 06:27:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:47,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:47,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:47,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:47,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:47,469 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:27:47,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:47,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:47,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:47,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:47,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:47,471 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-10 06:27:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:47,580 INFO L93 Difference]: Finished difference Result 17029 states and 27841 transitions. [2019-09-10 06:27:47,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:47,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:27:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:47,627 INFO L225 Difference]: With dead ends: 17029 [2019-09-10 06:27:47,628 INFO L226 Difference]: Without dead ends: 17029 [2019-09-10 06:27:47,629 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:27:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-10 06:27:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-10 06:27:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-10 06:27:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-10 06:27:47,951 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-10 06:27:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:47,951 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-10 06:27:47,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-10 06:27:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:27:47,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:47,955 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:27:47,955 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-10 06:27:47,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:47,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:48,218 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:27:48,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:48,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:48,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:48,220 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-10 06:27:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:48,517 INFO L93 Difference]: Finished difference Result 37659 states and 61652 transitions. [2019-09-10 06:27:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:48,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:27:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:48,659 INFO L225 Difference]: With dead ends: 37659 [2019-09-10 06:27:48,660 INFO L226 Difference]: Without dead ends: 37659 [2019-09-10 06:27:48,660 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:27:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-10 06:27:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-10 06:27:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-10 06:27:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-10 06:27:49,454 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-10 06:27:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:49,455 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-10 06:27:49,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-10 06:27:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:27:49,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:49,458 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:27:49,458 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-10 06:27:49,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:49,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:49,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:49,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:49,597 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:27:49,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:49,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:49,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:49,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:49,599 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-10 06:27:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:49,822 INFO L93 Difference]: Finished difference Result 38191 states and 62255 transitions. [2019-09-10 06:27:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:49,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:27:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:49,940 INFO L225 Difference]: With dead ends: 38191 [2019-09-10 06:27:49,940 INFO L226 Difference]: Without dead ends: 38191 [2019-09-10 06:27:49,942 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:27:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-10 06:27:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-10 06:27:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-10 06:27:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-10 06:27:51,522 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-10 06:27:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:51,523 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-10 06:27:51,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-10 06:27:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:27:51,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:51,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:51,525 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -390628183, now seen corresponding path program 1 times [2019-09-10 06:27:51,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:51,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:51,618 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:27:51,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:51,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:51,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:51,620 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-10 06:27:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:51,829 INFO L93 Difference]: Finished difference Result 56815 states and 92723 transitions. [2019-09-10 06:27:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:51,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:27:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:51,982 INFO L225 Difference]: With dead ends: 56815 [2019-09-10 06:27:51,982 INFO L226 Difference]: Without dead ends: 56815 [2019-09-10 06:27:51,983 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:27:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-10 06:27:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-10 06:27:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-10 06:27:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-10 06:27:52,985 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-10 06:27:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:52,986 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-10 06:27:52,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-10 06:27:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:27:52,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:52,988 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:27:52,988 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-10 06:27:52,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:52,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:52,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:53,147 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:27:53,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:53,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:53,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:53,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:53,149 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-10 06:27:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:53,623 INFO L93 Difference]: Finished difference Result 125501 states and 204991 transitions. [2019-09-10 06:27:53,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:53,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:27:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:54,011 INFO L225 Difference]: With dead ends: 125501 [2019-09-10 06:27:54,011 INFO L226 Difference]: Without dead ends: 125501 [2019-09-10 06:27:54,011 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:27:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-10 06:27:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-10 06:27:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:27:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-10 06:27:57,190 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-10 06:27:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:57,191 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-10 06:27:57,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-10 06:27:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 06:27:57,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:57,193 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] [2019-09-10 06:27:57,194 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-10 06:27:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:57,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:57,457 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:27:57,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:57,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:57,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:57,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:57,459 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-10 06:27:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:57,871 INFO L93 Difference]: Finished difference Result 90934 states and 147451 transitions. [2019-09-10 06:27:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:27:57,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 06:27:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:57,980 INFO L225 Difference]: With dead ends: 90934 [2019-09-10 06:27:57,980 INFO L226 Difference]: Without dead ends: 90934 [2019-09-10 06:27:57,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:27:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-10 06:28:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-10 06:28:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:28:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-10 06:28:00,680 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-10 06:28:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:00,680 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-10 06:28:00,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-10 06:28:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 06:28:00,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:00,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:00,683 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-10 06:28:00,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:00,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:00,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:00,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:00,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:00,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:00,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:00,972 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-10 06:28:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:01,726 INFO L93 Difference]: Finished difference Result 205462 states and 332581 transitions. [2019-09-10 06:28:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:01,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 06:28:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:02,613 INFO L225 Difference]: With dead ends: 205462 [2019-09-10 06:28:02,613 INFO L226 Difference]: Without dead ends: 205462 [2019-09-10 06:28:02,614 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:28:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-10 06:28:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-10 06:28:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-10 06:28:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-10 06:28:06,578 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-10 06:28:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:06,578 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-10 06:28:06,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-10 06:28:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:28:06,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:06,580 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:28:06,580 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-10 06:28:06,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:06,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:06,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:06,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:06,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:06,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:06,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:28:06,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:06,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:28:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:28:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:28:06,726 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-10 06:28:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:08,654 INFO L93 Difference]: Finished difference Result 394478 states and 634162 transitions. [2019-09-10 06:28:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:08,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 06:28:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:09,228 INFO L225 Difference]: With dead ends: 394478 [2019-09-10 06:28:09,228 INFO L226 Difference]: Without dead ends: 394478 [2019-09-10 06:28:09,228 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:28:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-10 06:28:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-10 06:28:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-10 06:28:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-10 06:28:16,364 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-10 06:28:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:16,364 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-10 06:28:16,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:28:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-10 06:28:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:28:16,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:16,372 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:16,372 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-10 06:28:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:16,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:28:16,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:16,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:16,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:16,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:16,585 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-10 06:28:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:21,820 INFO L93 Difference]: Finished difference Result 373577 states and 599998 transitions. [2019-09-10 06:28:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:21,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:28:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:22,315 INFO L225 Difference]: With dead ends: 373577 [2019-09-10 06:28:22,316 INFO L226 Difference]: Without dead ends: 373577 [2019-09-10 06:28:22,316 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:28:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-10 06:28:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-10 06:28:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-10 06:28:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-10 06:28:26,127 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-10 06:28:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:26,127 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-10 06:28:26,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-10 06:28:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:28:26,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:26,135 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:26,136 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-10 06:28:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:26,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:28:26,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:26,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:26,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:26,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:26,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:26,321 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-10 06:28:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:27,424 INFO L93 Difference]: Finished difference Result 413673 states and 664622 transitions. [2019-09-10 06:28:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:27,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:28:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:28,045 INFO L225 Difference]: With dead ends: 413673 [2019-09-10 06:28:28,045 INFO L226 Difference]: Without dead ends: 413673 [2019-09-10 06:28:28,045 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:28:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-10 06:28:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-10 06:28:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-10 06:28:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-10 06:28:37,243 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-10 06:28:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:37,243 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-10 06:28:37,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-10 06:28:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:28:37,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:37,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:37,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-10 06:28:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:37,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 06:28:37,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:37,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:37,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:37,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:37,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:37,424 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-10 06:28:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:40,060 INFO L93 Difference]: Finished difference Result 438685 states and 704878 transitions. [2019-09-10 06:28:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:40,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:28:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:40,709 INFO L225 Difference]: With dead ends: 438685 [2019-09-10 06:28:40,709 INFO L226 Difference]: Without dead ends: 438685 [2019-09-10 06:28:40,709 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:28:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-10 06:28:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-10 06:28:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-10 06:28:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-10 06:28:51,968 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-10 06:28:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:51,968 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-10 06:28:51,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-10 06:28:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:28:51,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:51,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:51,975 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1226506444, now seen corresponding path program 1 times [2019-09-10 06:28:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:51,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:28:52,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:52,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:52,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:52,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:52,172 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 6 states. [2019-09-10 06:29:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:00,250 INFO L93 Difference]: Finished difference Result 564669 states and 909650 transitions. [2019-09-10 06:29:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:29:00,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:29:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:01,197 INFO L225 Difference]: With dead ends: 564669 [2019-09-10 06:29:01,197 INFO L226 Difference]: Without dead ends: 564669 [2019-09-10 06:29:01,198 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:29:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564669 states. [2019-09-10 06:29:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564669 to 508157. [2019-09-10 06:29:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508157 states. [2019-09-10 06:29:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508157 states to 508157 states and 816726 transitions. [2019-09-10 06:29:08,549 INFO L78 Accepts]: Start accepts. Automaton has 508157 states and 816726 transitions. Word has length 167 [2019-09-10 06:29:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:08,549 INFO L475 AbstractCegarLoop]: Abstraction has 508157 states and 816726 transitions. [2019-09-10 06:29:08,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:29:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 508157 states and 816726 transitions. [2019-09-10 06:29:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:29:08,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:08,556 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:08,557 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 498916304, now seen corresponding path program 1 times [2019-09-10 06:29:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:08,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:29:08,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:08,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:08,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:08,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,662 INFO L87 Difference]: Start difference. First operand 508157 states and 816726 transitions. Second operand 3 states. [2019-09-10 06:29:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:12,296 INFO L93 Difference]: Finished difference Result 870701 states and 1400142 transitions. [2019-09-10 06:29:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:12,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:29:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:23,696 INFO L225 Difference]: With dead ends: 870701 [2019-09-10 06:29:23,696 INFO L226 Difference]: Without dead ends: 870701 [2019-09-10 06:29:23,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870701 states. [2019-09-10 06:29:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870701 to 869234. [2019-09-10 06:29:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869234 states. [2019-09-10 06:29:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869234 states to 869234 states and 1398676 transitions. [2019-09-10 06:29:54,782 INFO L78 Accepts]: Start accepts. Automaton has 869234 states and 1398676 transitions. Word has length 168 [2019-09-10 06:29:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:54,783 INFO L475 AbstractCegarLoop]: Abstraction has 869234 states and 1398676 transitions. [2019-09-10 06:29:54,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 869234 states and 1398676 transitions. [2019-09-10 06:29:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:29:54,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:54,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:54,789 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash -699174186, now seen corresponding path program 1 times [2019-09-10 06:29:54,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:54,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:55,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:29:55,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:29:55,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 06:29:55,089 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], [258], [282], [285], [287], [403], [406], [409], [412], [415], [418], [425], [433], [435], [438], [439], [441], [450], [453], [464], [467], [477], [499], [502], [539], [547], [555], [563], [585], [588], [625], [633], [641], [649], [671], [674], [711], [719], [727], [735], [745], [749], [753], [755], [757], [760], [797], [805], [813], [821], [1445], [1446], [1450], [1451], [1452] [2019-09-10 06:29:55,176 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:29:55,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:29:55,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:29:55,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:29:55,902 INFO L272 AbstractInterpreter]: Visited 146 different actions 259 times. Merged at 47 different actions 108 times. Never widened. Performed 1024 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 278 variables. [2019-09-10 06:29:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:55,907 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:29:56,591 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 89.09% of their original sizes. [2019-09-10 06:29:56,591 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:30:24,074 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 06:30:24,074 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:30:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:30:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [100] imperfect sequences [10] total 108 [2019-09-10 06:30:24,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:24,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 06:30:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 06:30:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1611, Invalid=8289, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 06:30:24,082 INFO L87 Difference]: Start difference. First operand 869234 states and 1398676 transitions. Second operand 100 states.