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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:22:43,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:22:43,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:22:43,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:22:43,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:22:43,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:22:43,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:22:43,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:22:43,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:22:43,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:22:43,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:22:43,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:22:43,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:22:43,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:22:43,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:22:43,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:22:43,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:22:43,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:22:43,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:22:43,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:22:43,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:22:43,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:22:43,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:22:43,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:22:43,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:22:43,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:22:43,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:22:43,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:22:43,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:22:43,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:22:43,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:22:43,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:22:43,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:22:43,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:22:43,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:22:43,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:22:43,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:22:43,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:22:43,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:22:43,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:22:43,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:22:43,995 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 07:22:44,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:22:44,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:22:44,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:22:44,024 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:22:44,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:22:44,025 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:22:44,025 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:22:44,026 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:22:44,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:22:44,026 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:22:44,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:22:44,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:22:44,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:22:44,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:22:44,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:22:44,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:22:44,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:22:44,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:22:44,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:22:44,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:22:44,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:22:44,031 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:22:44,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:22:44,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:22:44,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:22:44,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:22:44,032 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:22:44,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:22:44,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:22:44,032 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:22:44,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:22:44,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:22:44,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:22:44,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:22:44,093 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:22:44,094 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:22:44,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a159e579b/c542290acd1a4e7284920dc48c0f93be/FLAGdbd1f21e2 [2019-09-10 07:22:44,722 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:22:44,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:22:44,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a159e579b/c542290acd1a4e7284920dc48c0f93be/FLAGdbd1f21e2 [2019-09-10 07:22:44,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a159e579b/c542290acd1a4e7284920dc48c0f93be [2019-09-10 07:22:44,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:22:44,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:22:44,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:22:44,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:22:44,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:22:44,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:22:44" (1/1) ... [2019-09-10 07:22:44,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecc103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:44, skipping insertion in model container [2019-09-10 07:22:44,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:22:44" (1/1) ... [2019-09-10 07:22:45,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:22:45,058 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:22:45,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:22:45,512 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:22:45,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:22:45,649 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:22:45,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45 WrapperNode [2019-09-10 07:22:45,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:22:45,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:22:45,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:22:45,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:22:45,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (1/1) ... [2019-09-10 07:22:45,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:22:45,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:22:45,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:22:45,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:22:45,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (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 07:22:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:22:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:22:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:22:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:22:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:22:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:22:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:22:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:22:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:22:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:22:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:22:46,612 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:22:46,613 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:22:46,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:22:46 BoogieIcfgContainer [2019-09-10 07:22:46,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:22:46,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:22:46,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:22:46,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:22:46,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:22:44" (1/3) ... [2019-09-10 07:22:46,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f3f254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:22:46, skipping insertion in model container [2019-09-10 07:22:46,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:22:45" (2/3) ... [2019-09-10 07:22:46,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f3f254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:22:46, skipping insertion in model container [2019-09-10 07:22:46,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:22:46" (3/3) ... [2019-09-10 07:22:46,625 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:22:46,636 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:22:46,645 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:22:46,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:22:46,695 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:22:46,695 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:22:46,695 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:22:46,695 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:22:46,696 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:22:46,696 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:22:46,696 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:22:46,696 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:22:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2019-09-10 07:22:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:22:46,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:46,741 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] [2019-09-10 07:22:46,747 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:46,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1517721822, now seen corresponding path program 1 times [2019-09-10 07:22:46,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:46,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:46,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:46,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:46,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:47,340 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 07:22:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:47,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:47,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:47,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:47,370 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 3 states. [2019-09-10 07:22:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:47,447 INFO L93 Difference]: Finished difference Result 267 states and 433 transitions. [2019-09-10 07:22:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:47,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:22:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:47,466 INFO L225 Difference]: With dead ends: 267 [2019-09-10 07:22:47,466 INFO L226 Difference]: Without dead ends: 259 [2019-09-10 07:22:47,468 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 07:22:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-10 07:22:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2019-09-10 07:22:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-10 07:22:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-09-10 07:22:47,548 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 77 [2019-09-10 07:22:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:47,549 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-09-10 07:22:47,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-09-10 07:22:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:22:47,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:47,554 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] [2019-09-10 07:22:47,554 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash -23001505, now seen corresponding path program 1 times [2019-09-10 07:22:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:47,755 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 07:22:47,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:47,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:47,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:47,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:47,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:47,760 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 3 states. [2019-09-10 07:22:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:47,823 INFO L93 Difference]: Finished difference Result 434 states and 662 transitions. [2019-09-10 07:22:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:47,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:22:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:47,828 INFO L225 Difference]: With dead ends: 434 [2019-09-10 07:22:47,828 INFO L226 Difference]: Without dead ends: 434 [2019-09-10 07:22:47,829 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 07:22:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-10 07:22:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2019-09-10 07:22:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-10 07:22:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 661 transitions. [2019-09-10 07:22:47,857 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 661 transitions. Word has length 77 [2019-09-10 07:22:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:47,858 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 661 transitions. [2019-09-10 07:22:47,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 661 transitions. [2019-09-10 07:22:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:22:47,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:47,861 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] [2019-09-10 07:22:47,862 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 995200598, now seen corresponding path program 1 times [2019-09-10 07:22:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:48,013 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 07:22:48,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:48,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:48,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:48,019 INFO L87 Difference]: Start difference. First operand 432 states and 661 transitions. Second operand 3 states. [2019-09-10 07:22:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:48,068 INFO L93 Difference]: Finished difference Result 752 states and 1166 transitions. [2019-09-10 07:22:48,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:48,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:22:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:48,075 INFO L225 Difference]: With dead ends: 752 [2019-09-10 07:22:48,075 INFO L226 Difference]: Without dead ends: 752 [2019-09-10 07:22:48,076 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 07:22:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-10 07:22:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 750. [2019-09-10 07:22:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-10 07:22:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1165 transitions. [2019-09-10 07:22:48,116 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1165 transitions. Word has length 78 [2019-09-10 07:22:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:48,119 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1165 transitions. [2019-09-10 07:22:48,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1165 transitions. [2019-09-10 07:22:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:22:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:48,129 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] [2019-09-10 07:22:48,129 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash -122169238, now seen corresponding path program 1 times [2019-09-10 07:22:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:48,230 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 07:22:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:48,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:48,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:48,232 INFO L87 Difference]: Start difference. First operand 750 states and 1165 transitions. Second operand 3 states. [2019-09-10 07:22:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:48,266 INFO L93 Difference]: Finished difference Result 1324 states and 2066 transitions. [2019-09-10 07:22:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:48,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:22:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:48,275 INFO L225 Difference]: With dead ends: 1324 [2019-09-10 07:22:48,276 INFO L226 Difference]: Without dead ends: 1324 [2019-09-10 07:22:48,276 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 07:22:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-09-10 07:22:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2019-09-10 07:22:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-10 07:22:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2065 transitions. [2019-09-10 07:22:48,312 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2065 transitions. Word has length 79 [2019-09-10 07:22:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:48,313 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 2065 transitions. [2019-09-10 07:22:48,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2065 transitions. [2019-09-10 07:22:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:22:48,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:48,315 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] [2019-09-10 07:22:48,315 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1705087637, now seen corresponding path program 1 times [2019-09-10 07:22:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:48,413 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 07:22:48,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:48,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:48,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:48,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:48,415 INFO L87 Difference]: Start difference. First operand 1322 states and 2065 transitions. Second operand 3 states. [2019-09-10 07:22:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:48,449 INFO L93 Difference]: Finished difference Result 2340 states and 3650 transitions. [2019-09-10 07:22:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:48,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:22:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:48,462 INFO L225 Difference]: With dead ends: 2340 [2019-09-10 07:22:48,463 INFO L226 Difference]: Without dead ends: 2340 [2019-09-10 07:22:48,463 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 07:22:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2019-09-10 07:22:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2338. [2019-09-10 07:22:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-09-10 07:22:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3649 transitions. [2019-09-10 07:22:48,522 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3649 transitions. Word has length 80 [2019-09-10 07:22:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:48,523 INFO L475 AbstractCegarLoop]: Abstraction has 2338 states and 3649 transitions. [2019-09-10 07:22:48,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3649 transitions. [2019-09-10 07:22:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:22:48,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:48,524 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] [2019-09-10 07:22:48,524 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 143370377, now seen corresponding path program 1 times [2019-09-10 07:22:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:48,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:48,598 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 07:22:48,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:48,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:48,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:48,600 INFO L87 Difference]: Start difference. First operand 2338 states and 3649 transitions. Second operand 3 states. [2019-09-10 07:22:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:48,644 INFO L93 Difference]: Finished difference Result 4116 states and 6386 transitions. [2019-09-10 07:22:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:48,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:22:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:48,669 INFO L225 Difference]: With dead ends: 4116 [2019-09-10 07:22:48,669 INFO L226 Difference]: Without dead ends: 4116 [2019-09-10 07:22:48,670 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 07:22:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2019-09-10 07:22:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 4114. [2019-09-10 07:22:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-09-10 07:22:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 6385 transitions. [2019-09-10 07:22:48,787 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 6385 transitions. Word has length 81 [2019-09-10 07:22:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:48,789 INFO L475 AbstractCegarLoop]: Abstraction has 4114 states and 6385 transitions. [2019-09-10 07:22:48,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 6385 transitions. [2019-09-10 07:22:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:22:48,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:48,794 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] [2019-09-10 07:22:48,802 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash 801365652, now seen corresponding path program 1 times [2019-09-10 07:22:48,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:48,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:48,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:49,122 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 07:22:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:22:49,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:49,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:22:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:22:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:22:49,125 INFO L87 Difference]: Start difference. First operand 4114 states and 6385 transitions. Second operand 8 states. [2019-09-10 07:22:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:49,568 INFO L93 Difference]: Finished difference Result 20764 states and 31926 transitions. [2019-09-10 07:22:49,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:22:49,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 07:22:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:49,696 INFO L225 Difference]: With dead ends: 20764 [2019-09-10 07:22:49,696 INFO L226 Difference]: Without dead ends: 20764 [2019-09-10 07:22:49,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:22:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20764 states. [2019-09-10 07:22:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20764 to 20754. [2019-09-10 07:22:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20754 states. [2019-09-10 07:22:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20754 states to 20754 states and 31921 transitions. [2019-09-10 07:22:50,229 INFO L78 Accepts]: Start accepts. Automaton has 20754 states and 31921 transitions. Word has length 82 [2019-09-10 07:22:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:50,229 INFO L475 AbstractCegarLoop]: Abstraction has 20754 states and 31921 transitions. [2019-09-10 07:22:50,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:22:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20754 states and 31921 transitions. [2019-09-10 07:22:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:22:50,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:50,231 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] [2019-09-10 07:22:50,232 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 679148646, now seen corresponding path program 1 times [2019-09-10 07:22:50,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:50,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:50,486 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 07:22:50,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:50,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:22:50,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:50,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:22:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:22:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:22:50,488 INFO L87 Difference]: Start difference. First operand 20754 states and 31921 transitions. Second operand 8 states. [2019-09-10 07:22:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:51,725 INFO L93 Difference]: Finished difference Result 96190 states and 147511 transitions. [2019-09-10 07:22:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:22:51,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 07:22:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:51,973 INFO L225 Difference]: With dead ends: 96190 [2019-09-10 07:22:51,973 INFO L226 Difference]: Without dead ends: 96190 [2019-09-10 07:22:51,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:22:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96190 states. [2019-09-10 07:22:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96190 to 41458. [2019-09-10 07:22:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41458 states. [2019-09-10 07:22:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41458 states to 41458 states and 63025 transitions. [2019-09-10 07:22:53,347 INFO L78 Accepts]: Start accepts. Automaton has 41458 states and 63025 transitions. Word has length 84 [2019-09-10 07:22:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:53,348 INFO L475 AbstractCegarLoop]: Abstraction has 41458 states and 63025 transitions. [2019-09-10 07:22:53,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:22:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 41458 states and 63025 transitions. [2019-09-10 07:22:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:22:53,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:53,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:22:53,350 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -439761132, now seen corresponding path program 1 times [2019-09-10 07:22:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:53,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:53,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:53,456 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 07:22:53,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:53,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:22:53,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:53,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:22:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:22:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:22:53,459 INFO L87 Difference]: Start difference. First operand 41458 states and 63025 transitions. Second operand 5 states. [2019-09-10 07:22:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:53,781 INFO L93 Difference]: Finished difference Result 84402 states and 126769 transitions. [2019-09-10 07:22:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:22:53,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:22:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:53,976 INFO L225 Difference]: With dead ends: 84402 [2019-09-10 07:22:53,976 INFO L226 Difference]: Without dead ends: 84402 [2019-09-10 07:22:53,977 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 07:22:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84402 states. [2019-09-10 07:22:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84402 to 42994. [2019-09-10 07:22:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42994 states. [2019-09-10 07:22:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42994 states to 42994 states and 64561 transitions. [2019-09-10 07:22:56,171 INFO L78 Accepts]: Start accepts. Automaton has 42994 states and 64561 transitions. Word has length 85 [2019-09-10 07:22:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:56,171 INFO L475 AbstractCegarLoop]: Abstraction has 42994 states and 64561 transitions. [2019-09-10 07:22:56,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:22:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 42994 states and 64561 transitions. [2019-09-10 07:22:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:22:56,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:56,173 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] [2019-09-10 07:22:56,173 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -738073387, now seen corresponding path program 1 times [2019-09-10 07:22:56,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:56,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:56,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:56,252 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 07:22:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:56,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:56,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:56,254 INFO L87 Difference]: Start difference. First operand 42994 states and 64561 transitions. Second operand 3 states. [2019-09-10 07:22:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:56,424 INFO L93 Difference]: Finished difference Result 62294 states and 93124 transitions. [2019-09-10 07:22:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:56,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:22:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:56,552 INFO L225 Difference]: With dead ends: 62294 [2019-09-10 07:22:56,552 INFO L226 Difference]: Without dead ends: 62294 [2019-09-10 07:22:56,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 07:22:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62294 states. [2019-09-10 07:22:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62294 to 62292. [2019-09-10 07:22:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62292 states. [2019-09-10 07:22:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62292 states to 62292 states and 93123 transitions. [2019-09-10 07:22:57,655 INFO L78 Accepts]: Start accepts. Automaton has 62292 states and 93123 transitions. Word has length 86 [2019-09-10 07:22:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:57,655 INFO L475 AbstractCegarLoop]: Abstraction has 62292 states and 93123 transitions. [2019-09-10 07:22:57,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 62292 states and 93123 transitions. [2019-09-10 07:22:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:22:57,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:57,685 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:22:57,686 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash 817269783, now seen corresponding path program 1 times [2019-09-10 07:22:57,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:57,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:22:57,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:22:57,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:22:57,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 07:22:57,826 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [242], [247], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [472], [474], [477], [480], [483], [485], [487], [525], [527], [540], [548], [594], [595], [599], [600], [601] [2019-09-10 07:22:57,876 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:22:57,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:22:58,089 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:22:58,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:22:58,969 INFO L272 AbstractInterpreter]: Visited 106 different actions 674 times. Merged at 58 different actions 487 times. Widened at 19 different actions 67 times. Performed 2396 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 68 fixpoints after 15 different actions. Largest state had 169 variables. [2019-09-10 07:22:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:58,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:22:58,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:22:58,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:22:59,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:59,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:22:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:59,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:22:59,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:22:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:22:59,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:22:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:23:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:23:00,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:23:00,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 21 [2019-09-10 07:23:00,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:23:00,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:23:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:23:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:23:00,084 INFO L87 Difference]: Start difference. First operand 62292 states and 93123 transitions. Second operand 12 states. [2019-09-10 07:23:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:00,740 INFO L93 Difference]: Finished difference Result 122836 states and 183126 transitions. [2019-09-10 07:23:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:23:00,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-09-10 07:23:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:01,153 INFO L225 Difference]: With dead ends: 122836 [2019-09-10 07:23:01,154 INFO L226 Difference]: Without dead ends: 122836 [2019-09-10 07:23:01,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:23:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122836 states. [2019-09-10 07:23:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122836 to 103572. [2019-09-10 07:23:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103572 states. [2019-09-10 07:23:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103572 states to 103572 states and 154307 transitions. [2019-09-10 07:23:05,063 INFO L78 Accepts]: Start accepts. Automaton has 103572 states and 154307 transitions. Word has length 115 [2019-09-10 07:23:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:05,064 INFO L475 AbstractCegarLoop]: Abstraction has 103572 states and 154307 transitions. [2019-09-10 07:23:05,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:23:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 103572 states and 154307 transitions. [2019-09-10 07:23:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:23:05,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:05,095 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:23:05,096 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash 23744993, now seen corresponding path program 1 times [2019-09-10 07:23:05,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:05,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:05,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:05,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:05,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:05,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:05,188 INFO L87 Difference]: Start difference. First operand 103572 states and 154307 transitions. Second operand 3 states. [2019-09-10 07:23:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:05,741 INFO L93 Difference]: Finished difference Result 187894 states and 277988 transitions. [2019-09-10 07:23:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:05,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:23:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:06,043 INFO L225 Difference]: With dead ends: 187894 [2019-09-10 07:23:06,044 INFO L226 Difference]: Without dead ends: 187894 [2019-09-10 07:23:06,044 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 07:23:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187894 states. [2019-09-10 07:23:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187894 to 187892. [2019-09-10 07:23:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187892 states. [2019-09-10 07:23:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187892 states to 187892 states and 277987 transitions. [2019-09-10 07:23:10,486 INFO L78 Accepts]: Start accepts. Automaton has 187892 states and 277987 transitions. Word has length 116 [2019-09-10 07:23:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:10,486 INFO L475 AbstractCegarLoop]: Abstraction has 187892 states and 277987 transitions. [2019-09-10 07:23:10,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 187892 states and 277987 transitions. [2019-09-10 07:23:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:23:10,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:10,531 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:23:10,531 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash 38840002, now seen corresponding path program 1 times [2019-09-10 07:23:10,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:10,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:10,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:10,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:23:10,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:23:10,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:23:10,656 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [152], [155], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [249], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [463], [466], [474], [477], [480], [483], [485], [487], [525], [527], [540], [548], [594], [595], [599], [600], [601] [2019-09-10 07:23:10,662 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:23:10,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:23:10,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:23:11,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:23:11,166 INFO L272 AbstractInterpreter]: Visited 103 different actions 535 times. Merged at 52 different actions 367 times. Widened at 14 different actions 37 times. Performed 1943 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1943 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 44 fixpoints after 12 different actions. Largest state had 169 variables. [2019-09-10 07:23:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:11,167 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:23:11,774 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 80.82% of their original sizes. [2019-09-10 07:23:11,775 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:23:20,934 INFO L420 sIntCurrentIteration]: We unified 115 AI predicates to 115 [2019-09-10 07:23:20,935 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:23:20,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:23:20,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [7] total 68 [2019-09-10 07:23:20,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:20,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 07:23:20,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 07:23:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3493, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 07:23:20,939 INFO L87 Difference]: Start difference. First operand 187892 states and 277987 transitions. Second operand 63 states. [2019-09-10 07:25:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:17,781 INFO L93 Difference]: Finished difference Result 476075 states and 679625 transitions. [2019-09-10 07:25:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2019-09-10 07:25:17,781 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 116 [2019-09-10 07:25:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:18,946 INFO L225 Difference]: With dead ends: 476075 [2019-09-10 07:25:18,946 INFO L226 Difference]: Without dead ends: 476075 [2019-09-10 07:25:18,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35693 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=13117, Invalid=79603, Unknown=0, NotChecked=0, Total=92720 [2019-09-10 07:25:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476075 states. [2019-09-10 07:25:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476075 to 270537. [2019-09-10 07:25:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270537 states. [2019-09-10 07:25:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270537 states to 270537 states and 391948 transitions. [2019-09-10 07:25:28,500 INFO L78 Accepts]: Start accepts. Automaton has 270537 states and 391948 transitions. Word has length 116 [2019-09-10 07:25:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:28,501 INFO L475 AbstractCegarLoop]: Abstraction has 270537 states and 391948 transitions. [2019-09-10 07:25:28,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 07:25:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 270537 states and 391948 transitions. [2019-09-10 07:25:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:25:28,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:28,545 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:25:28,546 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -566872627, now seen corresponding path program 1 times [2019-09-10 07:25:28,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:28,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:28,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:28,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:28,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:28,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:28,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:28,627 INFO L87 Difference]: Start difference. First operand 270537 states and 391948 transitions. Second operand 3 states. [2019-09-10 07:25:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:29,777 INFO L93 Difference]: Finished difference Result 407662 states and 587040 transitions. [2019-09-10 07:25:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:29,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:25:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:30,405 INFO L225 Difference]: With dead ends: 407662 [2019-09-10 07:25:30,405 INFO L226 Difference]: Without dead ends: 407662 [2019-09-10 07:25:30,406 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 07:25:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407662 states. [2019-09-10 07:25:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407662 to 389891. [2019-09-10 07:25:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389891 states. [2019-09-10 07:25:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389891 states to 389891 states and 562587 transitions. [2019-09-10 07:25:43,225 INFO L78 Accepts]: Start accepts. Automaton has 389891 states and 562587 transitions. Word has length 116 [2019-09-10 07:25:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:43,225 INFO L475 AbstractCegarLoop]: Abstraction has 389891 states and 562587 transitions. [2019-09-10 07:25:43,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 389891 states and 562587 transitions. [2019-09-10 07:25:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:25:43,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:43,277 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:25:43,278 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2006417982, now seen corresponding path program 1 times [2019-09-10 07:25:43,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:43,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:43,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:43,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:43,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:43,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:43,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:43,352 INFO L87 Difference]: Start difference. First operand 389891 states and 562587 transitions. Second operand 3 states. [2019-09-10 07:25:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:46,244 INFO L93 Difference]: Finished difference Result 665193 states and 952166 transitions. [2019-09-10 07:25:46,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:46,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:25:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:47,092 INFO L225 Difference]: With dead ends: 665193 [2019-09-10 07:25:47,093 INFO L226 Difference]: Without dead ends: 665193 [2019-09-10 07:25:47,093 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 07:25:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665193 states. [2019-09-10 07:26:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665193 to 661527. [2019-09-10 07:26:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661527 states. [2019-09-10 07:26:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661527 states to 661527 states and 947361 transitions. [2019-09-10 07:26:11,665 INFO L78 Accepts]: Start accepts. Automaton has 661527 states and 947361 transitions. Word has length 116 [2019-09-10 07:26:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:11,666 INFO L475 AbstractCegarLoop]: Abstraction has 661527 states and 947361 transitions. [2019-09-10 07:26:11,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 661527 states and 947361 transitions. [2019-09-10 07:26:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:26:11,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:11,745 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:26:11,746 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash 506520702, now seen corresponding path program 1 times [2019-09-10 07:26:11,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:11,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:11,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:11,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:11,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:11,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:11,815 INFO L87 Difference]: Start difference. First operand 661527 states and 947361 transitions. Second operand 3 states. [2019-09-10 07:26:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:15,515 INFO L93 Difference]: Finished difference Result 998812 states and 1416291 transitions. [2019-09-10 07:26:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:15,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:26:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:16,974 INFO L225 Difference]: With dead ends: 998812 [2019-09-10 07:26:16,974 INFO L226 Difference]: Without dead ends: 998812 [2019-09-10 07:26:16,975 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 07:26:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998812 states. [2019-09-10 07:26:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998812 to 968351. [2019-09-10 07:26:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968351 states. [2019-09-10 07:26:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968351 states to 968351 states and 1375816 transitions. [2019-09-10 07:26:50,774 INFO L78 Accepts]: Start accepts. Automaton has 968351 states and 1375816 transitions. Word has length 116 [2019-09-10 07:26:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:50,774 INFO L475 AbstractCegarLoop]: Abstraction has 968351 states and 1375816 transitions. [2019-09-10 07:26:50,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 968351 states and 1375816 transitions. [2019-09-10 07:26:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:26:50,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:50,874 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:26:50,875 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash -971930147, now seen corresponding path program 1 times [2019-09-10 07:26:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:50,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:50,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:50,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:50,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,949 INFO L87 Difference]: Start difference. First operand 968351 states and 1375816 transitions. Second operand 3 states. [2019-09-10 07:27:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:02,722 INFO L93 Difference]: Finished difference Result 1345597 states and 1888499 transitions. [2019-09-10 07:27:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:02,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:27:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:13,893 INFO L225 Difference]: With dead ends: 1345597 [2019-09-10 07:27:13,893 INFO L226 Difference]: Without dead ends: 1345597 [2019-09-10 07:27:13,894 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 07:27:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345597 states. [2019-09-10 07:27:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345597 to 1285631. [2019-09-10 07:27:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285631 states. [2019-09-10 07:27:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285631 states to 1285631 states and 1809011 transitions. [2019-09-10 07:27:45,200 INFO L78 Accepts]: Start accepts. Automaton has 1285631 states and 1809011 transitions. Word has length 116 [2019-09-10 07:27:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:45,201 INFO L475 AbstractCegarLoop]: Abstraction has 1285631 states and 1809011 transitions. [2019-09-10 07:27:45,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1285631 states and 1809011 transitions. [2019-09-10 07:27:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:27:57,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:57,970 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:27:57,970 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1458765978, now seen corresponding path program 1 times [2019-09-10 07:27:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:57,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:58,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:58,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:58,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:58,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:58,045 INFO L87 Difference]: Start difference. First operand 1285631 states and 1809011 transitions. Second operand 3 states. [2019-09-10 07:28:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:02,065 INFO L93 Difference]: Finished difference Result 1475335 states and 2047115 transitions. [2019-09-10 07:28:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:28:13,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:28:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:15,234 INFO L225 Difference]: With dead ends: 1475335 [2019-09-10 07:28:15,235 INFO L226 Difference]: Without dead ends: 1309026 [2019-09-10 07:28:15,235 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 07:28:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309026 states. [2019-09-10 07:28:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309026 to 1261262. [2019-09-10 07:28:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261262 states.