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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:12:44,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:12:44,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:12:44,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:12:44,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:12:44,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:12:44,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:12:44,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:12:44,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:12:44,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:12:44,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:12:44,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:12:44,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:12:44,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:12:44,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:12:44,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:12:44,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:12:44,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:12:44,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:12:44,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:12:44,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:12:44,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:12:44,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:12:44,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:12:44,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:12:44,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:12:44,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:12:44,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:12:44,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:12:44,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:12:44,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:12:44,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:12:44,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:12:44,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:12:44,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:12:44,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:12:44,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:12:44,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:12:44,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:12:44,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:12:44,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:12:44,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:12:44,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:12:44,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:12:44,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:12:44,271 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:12:44,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:12:44,272 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:12:44,272 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:12:44,273 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:12:44,273 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:12:44,273 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:12:44,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:12:44,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:12:44,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:12:44,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:12:44,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:12:44,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:12:44,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:12:44,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:12:44,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:12:44,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:12:44,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:12:44,276 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:12:44,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:12:44,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:12:44,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:12:44,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:12:44,277 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:12:44,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:12:44,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:12:44,278 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:12:44,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:12:44,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:12:44,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:12:44,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:12:44,323 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:12:44,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:12:44,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc397225/032e774e6eaa405ea554651a44fabd8f/FLAG0c61c919c [2019-09-10 08:12:44,891 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:12:44,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:12:44,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc397225/032e774e6eaa405ea554651a44fabd8f/FLAG0c61c919c [2019-09-10 08:12:45,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc397225/032e774e6eaa405ea554651a44fabd8f [2019-09-10 08:12:45,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:12:45,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:12:45,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:12:45,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:12:45,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:12:45,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45, skipping insertion in model container [2019-09-10 08:12:45,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:12:45,308 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:12:45,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:12:45,710 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:12:45,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:12:45,825 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:12:45,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45 WrapperNode [2019-09-10 08:12:45,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:12:45,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:12:45,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:12:45,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:12:45,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (1/1) ... [2019-09-10 08:12:45,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:12:45,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:12:45,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:12:45,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:12:45,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12: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 08:12:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:12:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:12:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:12:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:12:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:12:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:12:46,713 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:12:46,714 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:12:46,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:12:46 BoogieIcfgContainer [2019-09-10 08:12:46,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:12:46,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:12:46,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:12:46,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:12:46,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:12:45" (1/3) ... [2019-09-10 08:12:46,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543b4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:12:46, skipping insertion in model container [2019-09-10 08:12:46,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:45" (2/3) ... [2019-09-10 08:12:46,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543b4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:12:46, skipping insertion in model container [2019-09-10 08:12:46,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:12:46" (3/3) ... [2019-09-10 08:12:46,724 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:12:46,732 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:12:46,741 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:12:46,758 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:12:46,782 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:12:46,783 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:12:46,783 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:12:46,783 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:12:46,783 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:12:46,784 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:12:46,784 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:12:46,784 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:12:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-10 08:12:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:12:46,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:46,818 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 08:12:46,821 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 690229661, now seen corresponding path program 1 times [2019-09-10 08:12:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:46,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:47,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:47,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:47,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:47,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:47,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:47,361 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-09-10 08:12:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:47,458 INFO L93 Difference]: Finished difference Result 191 states and 308 transitions. [2019-09-10 08:12:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:47,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 08:12:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:47,485 INFO L225 Difference]: With dead ends: 191 [2019-09-10 08:12:47,486 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 08:12:47,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 08:12:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-09-10 08:12:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 08:12:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2019-09-10 08:12:47,586 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 77 [2019-09-10 08:12:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:47,587 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2019-09-10 08:12:47,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2019-09-10 08:12:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:12:47,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:47,593 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 08:12:47,594 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -675217057, now seen corresponding path program 1 times [2019-09-10 08:12:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:47,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:47,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:47,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:47,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:47,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:47,816 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand 3 states. [2019-09-10 08:12:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:47,850 INFO L93 Difference]: Finished difference Result 299 states and 445 transitions. [2019-09-10 08:12:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:47,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 08:12:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:47,854 INFO L225 Difference]: With dead ends: 299 [2019-09-10 08:12:47,854 INFO L226 Difference]: Without dead ends: 299 [2019-09-10 08:12:47,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-10 08:12:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2019-09-10 08:12:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-10 08:12:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-10 08:12:47,880 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 78 [2019-09-10 08:12:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:47,881 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-10 08:12:47,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-10 08:12:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:12:47,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:47,887 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 08:12:47,887 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash 435331309, now seen corresponding path program 1 times [2019-09-10 08:12:47,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:47,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:48,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:48,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:48,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:48,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,033 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 3 states. [2019-09-10 08:12:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:48,061 INFO L93 Difference]: Finished difference Result 515 states and 785 transitions. [2019-09-10 08:12:48,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:48,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 08:12:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:48,067 INFO L225 Difference]: With dead ends: 515 [2019-09-10 08:12:48,067 INFO L226 Difference]: Without dead ends: 515 [2019-09-10 08:12:48,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-10 08:12:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2019-09-10 08:12:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-10 08:12:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 784 transitions. [2019-09-10 08:12:48,090 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 784 transitions. Word has length 79 [2019-09-10 08:12:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:48,091 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 784 transitions. [2019-09-10 08:12:48,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 784 transitions. [2019-09-10 08:12:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:12:48,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:48,093 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 08:12:48,093 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -903037179, now seen corresponding path program 1 times [2019-09-10 08:12:48,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:48,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:48,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:48,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:48,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,176 INFO L87 Difference]: Start difference. First operand 513 states and 784 transitions. Second operand 3 states. [2019-09-10 08:12:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:48,199 INFO L93 Difference]: Finished difference Result 915 states and 1409 transitions. [2019-09-10 08:12:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:48,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 08:12:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:48,206 INFO L225 Difference]: With dead ends: 915 [2019-09-10 08:12:48,206 INFO L226 Difference]: Without dead ends: 915 [2019-09-10 08:12:48,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-10 08:12:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-10 08:12:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-10 08:12:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1408 transitions. [2019-09-10 08:12:48,234 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1408 transitions. Word has length 80 [2019-09-10 08:12:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:48,235 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1408 transitions. [2019-09-10 08:12:48,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1408 transitions. [2019-09-10 08:12:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:12:48,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:48,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:48,237 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -441467371, now seen corresponding path program 1 times [2019-09-10 08:12:48,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:48,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:48,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:48,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:48,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,356 INFO L87 Difference]: Start difference. First operand 913 states and 1408 transitions. Second operand 3 states. [2019-09-10 08:12:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:48,387 INFO L93 Difference]: Finished difference Result 1651 states and 2545 transitions. [2019-09-10 08:12:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:48,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 08:12:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:48,396 INFO L225 Difference]: With dead ends: 1651 [2019-09-10 08:12:48,396 INFO L226 Difference]: Without dead ends: 1651 [2019-09-10 08:12:48,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-09-10 08:12:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2019-09-10 08:12:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 08:12:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2544 transitions. [2019-09-10 08:12:48,433 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2544 transitions. Word has length 81 [2019-09-10 08:12:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:48,433 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2544 transitions. [2019-09-10 08:12:48,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2544 transitions. [2019-09-10 08:12:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:12:48,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:48,435 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 08:12:48,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -22564349, now seen corresponding path program 1 times [2019-09-10 08:12:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:48,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:48,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:48,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:48,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:48,538 INFO L87 Difference]: Start difference. First operand 1649 states and 2544 transitions. Second operand 5 states. [2019-09-10 08:12:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:48,806 INFO L93 Difference]: Finished difference Result 3251 states and 5009 transitions. [2019-09-10 08:12:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:48,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:12:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:48,822 INFO L225 Difference]: With dead ends: 3251 [2019-09-10 08:12:48,823 INFO L226 Difference]: Without dead ends: 3251 [2019-09-10 08:12:48,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:12:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2019-09-10 08:12:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3249. [2019-09-10 08:12:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-10 08:12:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 5008 transitions. [2019-09-10 08:12:48,897 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 5008 transitions. Word has length 82 [2019-09-10 08:12:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:48,898 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 5008 transitions. [2019-09-10 08:12:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 5008 transitions. [2019-09-10 08:12:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:12:48,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:48,899 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 08:12:48,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1698766526, now seen corresponding path program 1 times [2019-09-10 08:12:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:48,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:49,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:49,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:49,015 INFO L87 Difference]: Start difference. First operand 3249 states and 5008 transitions. Second operand 5 states. [2019-09-10 08:12:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:49,195 INFO L93 Difference]: Finished difference Result 3249 states and 4976 transitions. [2019-09-10 08:12:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:49,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:12:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:49,213 INFO L225 Difference]: With dead ends: 3249 [2019-09-10 08:12:49,213 INFO L226 Difference]: Without dead ends: 3249 [2019-09-10 08:12:49,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:12:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-09-10 08:12:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3249. [2019-09-10 08:12:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-10 08:12:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4976 transitions. [2019-09-10 08:12:49,295 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4976 transitions. Word has length 82 [2019-09-10 08:12:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:49,296 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 4976 transitions. [2019-09-10 08:12:49,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4976 transitions. [2019-09-10 08:12:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:12:49,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:49,298 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 08:12:49,300 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -143264007, now seen corresponding path program 1 times [2019-09-10 08:12:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:49,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:49,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:49,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:49,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:49,416 INFO L87 Difference]: Start difference. First operand 3249 states and 4976 transitions. Second operand 5 states. [2019-09-10 08:12:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:49,569 INFO L93 Difference]: Finished difference Result 3249 states and 4944 transitions. [2019-09-10 08:12:49,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:49,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:12:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:49,585 INFO L225 Difference]: With dead ends: 3249 [2019-09-10 08:12:49,586 INFO L226 Difference]: Without dead ends: 3249 [2019-09-10 08:12:49,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:12:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-09-10 08:12:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3249. [2019-09-10 08:12:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-10 08:12:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4944 transitions. [2019-09-10 08:12:49,652 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4944 transitions. Word has length 82 [2019-09-10 08:12:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:49,653 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 4944 transitions. [2019-09-10 08:12:49,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4944 transitions. [2019-09-10 08:12:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:12:49,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:49,654 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 08:12:49,654 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1607335564, now seen corresponding path program 1 times [2019-09-10 08:12:49,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:49,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:12:49,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:49,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:12:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:12:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:12:49,884 INFO L87 Difference]: Start difference. First operand 3249 states and 4944 transitions. Second operand 8 states. [2019-09-10 08:12:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:50,357 INFO L93 Difference]: Finished difference Result 32067 states and 48505 transitions. [2019-09-10 08:12:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:12:50,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 08:12:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:50,481 INFO L225 Difference]: With dead ends: 32067 [2019-09-10 08:12:50,481 INFO L226 Difference]: Without dead ends: 32067 [2019-09-10 08:12:50,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:12:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32067 states. [2019-09-10 08:12:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32067 to 9649. [2019-09-10 08:12:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9649 states. [2019-09-10 08:12:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9649 states to 9649 states and 14608 transitions. [2019-09-10 08:12:50,936 INFO L78 Accepts]: Start accepts. Automaton has 9649 states and 14608 transitions. Word has length 82 [2019-09-10 08:12:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:50,936 INFO L475 AbstractCegarLoop]: Abstraction has 9649 states and 14608 transitions. [2019-09-10 08:12:50,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:12:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9649 states and 14608 transitions. [2019-09-10 08:12:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:12:50,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:50,938 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 08:12:50,939 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash 645559087, now seen corresponding path program 1 times [2019-09-10 08:12:50,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:50,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:51,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:51,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:51,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:51,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:51,029 INFO L87 Difference]: Start difference. First operand 9649 states and 14608 transitions. Second operand 3 states. [2019-09-10 08:12:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:51,111 INFO L93 Difference]: Finished difference Result 13939 states and 20689 transitions. [2019-09-10 08:12:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:51,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 08:12:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:51,143 INFO L225 Difference]: With dead ends: 13939 [2019-09-10 08:12:51,144 INFO L226 Difference]: Without dead ends: 13939 [2019-09-10 08:12:51,144 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 08:12:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13939 states. [2019-09-10 08:12:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13939 to 13841. [2019-09-10 08:12:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-09-10 08:12:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 20592 transitions. [2019-09-10 08:12:51,360 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 20592 transitions. Word has length 84 [2019-09-10 08:12:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:51,361 INFO L475 AbstractCegarLoop]: Abstraction has 13841 states and 20592 transitions. [2019-09-10 08:12:51,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 20592 transitions. [2019-09-10 08:12:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:12:51,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:51,363 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 08:12:51,363 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 665608430, now seen corresponding path program 1 times [2019-09-10 08:12:51,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:51,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:51,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:51,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:12:51,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:51,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:12:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:12:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:12:51,779 INFO L87 Difference]: Start difference. First operand 13841 states and 20592 transitions. Second operand 8 states. [2019-09-10 08:12:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:52,017 INFO L93 Difference]: Finished difference Result 17047 states and 25395 transitions. [2019-09-10 08:12:52,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:12:52,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 08:12:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:52,055 INFO L225 Difference]: With dead ends: 17047 [2019-09-10 08:12:52,055 INFO L226 Difference]: Without dead ends: 17047 [2019-09-10 08:12:52,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17047 states. [2019-09-10 08:12:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17047 to 13841. [2019-09-10 08:12:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-09-10 08:12:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 20496 transitions. [2019-09-10 08:12:52,290 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 20496 transitions. Word has length 84 [2019-09-10 08:12:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:52,291 INFO L475 AbstractCegarLoop]: Abstraction has 13841 states and 20496 transitions. [2019-09-10 08:12:52,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:12:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 20496 transitions. [2019-09-10 08:12:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:12:52,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:52,292 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 08:12:52,293 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash 851756344, now seen corresponding path program 1 times [2019-09-10 08:12:52,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:52,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:52,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:52,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:52,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:52,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:52,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:52,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:52,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:52,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:52,803 INFO L87 Difference]: Start difference. First operand 13841 states and 20496 transitions. Second operand 3 states. [2019-09-10 08:12:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:52,877 INFO L93 Difference]: Finished difference Result 21525 states and 31827 transitions. [2019-09-10 08:12:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:52,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 08:12:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:52,926 INFO L225 Difference]: With dead ends: 21525 [2019-09-10 08:12:52,926 INFO L226 Difference]: Without dead ends: 21525 [2019-09-10 08:12:52,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21525 states. [2019-09-10 08:12:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21525 to 21523. [2019-09-10 08:12:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21523 states. [2019-09-10 08:12:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21523 states to 21523 states and 31826 transitions. [2019-09-10 08:12:53,253 INFO L78 Accepts]: Start accepts. Automaton has 21523 states and 31826 transitions. Word has length 85 [2019-09-10 08:12:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:53,253 INFO L475 AbstractCegarLoop]: Abstraction has 21523 states and 31826 transitions. [2019-09-10 08:12:53,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21523 states and 31826 transitions. [2019-09-10 08:12:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:12:53,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:53,254 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 08:12:53,255 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash -842884464, now seen corresponding path program 1 times [2019-09-10 08:12:53,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:53,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:53,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:53,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:53,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:53,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:53,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:53,414 INFO L87 Difference]: Start difference. First operand 21523 states and 31826 transitions. Second operand 5 states. [2019-09-10 08:12:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:53,558 INFO L93 Difference]: Finished difference Result 41733 states and 61001 transitions. [2019-09-10 08:12:53,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:12:53,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 08:12:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:53,644 INFO L225 Difference]: With dead ends: 41733 [2019-09-10 08:12:53,645 INFO L226 Difference]: Without dead ends: 41733 [2019-09-10 08:12:53,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:12:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41733 states. [2019-09-10 08:12:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41733 to 22355. [2019-09-10 08:12:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22355 states. [2019-09-10 08:12:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22355 states to 22355 states and 32626 transitions. [2019-09-10 08:12:54,115 INFO L78 Accepts]: Start accepts. Automaton has 22355 states and 32626 transitions. Word has length 85 [2019-09-10 08:12:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:54,115 INFO L475 AbstractCegarLoop]: Abstraction has 22355 states and 32626 transitions. [2019-09-10 08:12:54,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22355 states and 32626 transitions. [2019-09-10 08:12:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:12:54,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:54,126 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:54,127 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash 897657587, now seen corresponding path program 1 times [2019-09-10 08:12:54,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:54,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:54,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:54,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:54,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:54,212 INFO L87 Difference]: Start difference. First operand 22355 states and 32626 transitions. Second operand 3 states. [2019-09-10 08:12:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:54,351 INFO L93 Difference]: Finished difference Result 18145 states and 26504 transitions. [2019-09-10 08:12:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:54,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:12:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:54,386 INFO L225 Difference]: With dead ends: 18145 [2019-09-10 08:12:54,386 INFO L226 Difference]: Without dead ends: 18145 [2019-09-10 08:12:54,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18145 states. [2019-09-10 08:12:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18145 to 18143. [2019-09-10 08:12:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-09-10 08:12:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 26503 transitions. [2019-09-10 08:12:54,681 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 26503 transitions. Word has length 116 [2019-09-10 08:12:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:54,682 INFO L475 AbstractCegarLoop]: Abstraction has 18143 states and 26503 transitions. [2019-09-10 08:12:54,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 26503 transitions. [2019-09-10 08:12:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:12:54,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:54,692 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, 1] [2019-09-10 08:12:54,693 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash 521539718, now seen corresponding path program 1 times [2019-09-10 08:12:54,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:54,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:12:54,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:54,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:12:54,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:54,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:12:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:12:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:12:54,932 INFO L87 Difference]: Start difference. First operand 18143 states and 26503 transitions. Second operand 8 states. [2019-09-10 08:12:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:55,487 INFO L93 Difference]: Finished difference Result 90347 states and 131981 transitions. [2019-09-10 08:12:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:12:55,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:12:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:55,619 INFO L225 Difference]: With dead ends: 90347 [2019-09-10 08:12:55,619 INFO L226 Difference]: Without dead ends: 90347 [2019-09-10 08:12:55,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:12:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90347 states. [2019-09-10 08:12:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90347 to 30175. [2019-09-10 08:12:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30175 states. [2019-09-10 08:12:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30175 states to 30175 states and 43847 transitions. [2019-09-10 08:12:56,411 INFO L78 Accepts]: Start accepts. Automaton has 30175 states and 43847 transitions. Word has length 117 [2019-09-10 08:12:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:56,412 INFO L475 AbstractCegarLoop]: Abstraction has 30175 states and 43847 transitions. [2019-09-10 08:12:56,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:12:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30175 states and 43847 transitions. [2019-09-10 08:12:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:12:56,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:56,421 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, 1] [2019-09-10 08:12:56,422 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -48478900, now seen corresponding path program 1 times [2019-09-10 08:12:56,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:12:56,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:12:56,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:56,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:12:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:12:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:12:56,761 INFO L87 Difference]: Start difference. First operand 30175 states and 43847 transitions. Second operand 8 states. [2019-09-10 08:12:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:57,163 INFO L93 Difference]: Finished difference Result 96363 states and 140781 transitions. [2019-09-10 08:12:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:12:57,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:12:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:57,259 INFO L225 Difference]: With dead ends: 96363 [2019-09-10 08:12:57,259 INFO L226 Difference]: Without dead ends: 96363 [2019-09-10 08:12:57,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:12:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96363 states. [2019-09-10 08:12:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96363 to 36191. [2019-09-10 08:12:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36191 states. [2019-09-10 08:12:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36191 states to 36191 states and 52647 transitions. [2019-09-10 08:12:58,936 INFO L78 Accepts]: Start accepts. Automaton has 36191 states and 52647 transitions. Word has length 117 [2019-09-10 08:12:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:58,937 INFO L475 AbstractCegarLoop]: Abstraction has 36191 states and 52647 transitions. [2019-09-10 08:12:58,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:12:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36191 states and 52647 transitions. [2019-09-10 08:12:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:12:58,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:58,946 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, 1] [2019-09-10 08:12:58,947 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1639874962, now seen corresponding path program 1 times [2019-09-10 08:12:58,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:12:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:12:59,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:59,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:12:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:12:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:12:59,160 INFO L87 Difference]: Start difference. First operand 36191 states and 52647 transitions. Second operand 8 states. [2019-09-10 08:12:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:59,583 INFO L93 Difference]: Finished difference Result 78315 states and 113869 transitions. [2019-09-10 08:12:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:12:59,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:12:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:59,687 INFO L225 Difference]: With dead ends: 78315 [2019-09-10 08:12:59,687 INFO L226 Difference]: Without dead ends: 78315 [2019-09-10 08:12:59,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:12:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78315 states. [2019-09-10 08:13:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78315 to 48223. [2019-09-10 08:13:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48223 states. [2019-09-10 08:13:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48223 states to 48223 states and 69991 transitions. [2019-09-10 08:13:00,549 INFO L78 Accepts]: Start accepts. Automaton has 48223 states and 69991 transitions. Word has length 117 [2019-09-10 08:13:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:00,549 INFO L475 AbstractCegarLoop]: Abstraction has 48223 states and 69991 transitions. [2019-09-10 08:13:00,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:13:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48223 states and 69991 transitions. [2019-09-10 08:13:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:13:00,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:00,557 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, 1] [2019-09-10 08:13:00,557 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash -346463388, now seen corresponding path program 1 times [2019-09-10 08:13:00,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:13:00,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:00,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:13:00,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:00,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:13:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:13:00,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:13:00,739 INFO L87 Difference]: Start difference. First operand 48223 states and 69991 transitions. Second operand 8 states. [2019-09-10 08:13:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:01,155 INFO L93 Difference]: Finished difference Result 90347 states and 131213 transitions. [2019-09-10 08:13:01,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:13:01,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:13:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:01,246 INFO L225 Difference]: With dead ends: 90347 [2019-09-10 08:13:01,246 INFO L226 Difference]: Without dead ends: 90347 [2019-09-10 08:13:01,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:13:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90347 states. [2019-09-10 08:13:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90347 to 60255. [2019-09-10 08:13:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2019-09-10 08:13:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 87335 transitions. [2019-09-10 08:13:03,111 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 87335 transitions. Word has length 117 [2019-09-10 08:13:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:03,111 INFO L475 AbstractCegarLoop]: Abstraction has 60255 states and 87335 transitions. [2019-09-10 08:13:03,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:13:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 87335 transitions. [2019-09-10 08:13:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:13:03,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:03,119 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, 1] [2019-09-10 08:13:03,120 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -370208610, now seen corresponding path program 1 times [2019-09-10 08:13:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:03,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:03,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:13:03,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:03,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:13:03,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:03,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:13:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:13:03,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:13:03,305 INFO L87 Difference]: Start difference. First operand 60255 states and 87335 transitions. Second operand 8 states. [2019-09-10 08:13:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:03,711 INFO L93 Difference]: Finished difference Result 102379 states and 148557 transitions. [2019-09-10 08:13:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:13:03,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:13:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:03,824 INFO L225 Difference]: With dead ends: 102379 [2019-09-10 08:13:03,824 INFO L226 Difference]: Without dead ends: 102379 [2019-09-10 08:13:03,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:13:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102379 states. [2019-09-10 08:13:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102379 to 72287. [2019-09-10 08:13:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72287 states. [2019-09-10 08:13:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72287 states to 72287 states and 104679 transitions. [2019-09-10 08:13:04,857 INFO L78 Accepts]: Start accepts. Automaton has 72287 states and 104679 transitions. Word has length 117 [2019-09-10 08:13:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:04,857 INFO L475 AbstractCegarLoop]: Abstraction has 72287 states and 104679 transitions. [2019-09-10 08:13:04,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:13:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 72287 states and 104679 transitions. [2019-09-10 08:13:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:13:04,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:04,864 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, 1] [2019-09-10 08:13:04,865 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -742734504, now seen corresponding path program 1 times [2019-09-10 08:13:04,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:04,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:04,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:04,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:04,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 08:13:04,974 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], [125], [128], [133], [141], [143], [146], [154], [156], [159], [167], [169], [172], [175], [180], [182], [185], [193], [195], [198], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [294], [297], [303], [306], [309], [311], [326], [328], [331], [334], [336], [351], [353], [356], [359], [361], [376], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:13:05,021 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:05,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:05,203 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:06,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:06,151 INFO L272 AbstractInterpreter]: Visited 109 different actions 808 times. Merged at 62 different actions 608 times. Widened at 23 different actions 90 times. Performed 2847 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2847 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 77 fixpoints after 20 different actions. Largest state had 153 variables. [2019-09-10 08:13:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:06,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:06,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:06,157 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 08:13:06,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:06,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:13:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:06,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:13:06,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:13:06,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:13:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:13:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:13:06,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:06,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:13:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:13:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:13:06,661 INFO L87 Difference]: Start difference. First operand 72287 states and 104679 transitions. Second operand 8 states. [2019-09-10 08:13:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:08,282 INFO L93 Difference]: Finished difference Result 114411 states and 165901 transitions. [2019-09-10 08:13:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:13:08,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:13:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:08,719 INFO L225 Difference]: With dead ends: 114411 [2019-09-10 08:13:08,720 INFO L226 Difference]: Without dead ends: 114411 [2019-09-10 08:13:08,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:13:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114411 states. [2019-09-10 08:13:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114411 to 84319. [2019-09-10 08:13:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84319 states. [2019-09-10 08:13:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84319 states to 84319 states and 122023 transitions. [2019-09-10 08:13:10,206 INFO L78 Accepts]: Start accepts. Automaton has 84319 states and 122023 transitions. Word has length 117 [2019-09-10 08:13:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:10,206 INFO L475 AbstractCegarLoop]: Abstraction has 84319 states and 122023 transitions. [2019-09-10 08:13:10,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:13:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84319 states and 122023 transitions. [2019-09-10 08:13:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:13:10,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:10,225 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:10,225 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1924244045, now seen corresponding path program 1 times [2019-09-10 08:13:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:10,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:10,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:10,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:10,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:10,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:10,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 08:13:10,520 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], [125], [128], [133], [141], [143], [146], [154], [156], [159], [167], [169], [172], [180], [182], [185], [193], [195], [198], [206], [208], [211], [214], [218], [220], [223], [224], [226], [228], [233], [235], [238], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [301], [303], [306], [309], [311], [326], [328], [331], [334], [336], [351], [353], [356], [359], [361], [376], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:13:10,530 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:10,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:10,564 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:11,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:11,403 INFO L272 AbstractInterpreter]: Visited 109 different actions 874 times. Merged at 61 different actions 658 times. Widened at 23 different actions 85 times. Performed 3101 root evaluator evaluations with a maximum evaluation depth of 8. Performed 3101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 111 fixpoints after 23 different actions. Largest state had 153 variables. [2019-09-10 08:13:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:11,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:11,404 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:13:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:11,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:13:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:11,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:13:11,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:13:11,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:13:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 08:13:11,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:11,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:13:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:13:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:13:11,835 INFO L87 Difference]: Start difference. First operand 84319 states and 122023 transitions. Second operand 12 states. [2019-09-10 08:13:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:19,222 INFO L93 Difference]: Finished difference Result 636780 states and 893886 transitions. [2019-09-10 08:13:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 08:13:19,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 08:13:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:20,035 INFO L225 Difference]: With dead ends: 636780 [2019-09-10 08:13:20,035 INFO L226 Difference]: Without dead ends: 636780 [2019-09-10 08:13:20,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=832, Invalid=3458, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 08:13:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636780 states. [2019-09-10 08:13:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636780 to 233204. [2019-09-10 08:13:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233204 states. [2019-09-10 08:13:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233204 states to 233204 states and 326727 transitions. [2019-09-10 08:13:27,409 INFO L78 Accepts]: Start accepts. Automaton has 233204 states and 326727 transitions. Word has length 118 [2019-09-10 08:13:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:27,409 INFO L475 AbstractCegarLoop]: Abstraction has 233204 states and 326727 transitions. [2019-09-10 08:13:27,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:13:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 233204 states and 326727 transitions. [2019-09-10 08:13:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:13:27,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:27,416 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, 1, 1, 1] [2019-09-10 08:13:27,416 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:27,416 INFO L82 PathProgramCache]: Analyzing trace with hash 178915903, now seen corresponding path program 1 times [2019-09-10 08:13:27,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:27,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:27,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:27,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:27,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:27,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 08:13:27,637 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], [125], [128], [133], [136], [141], [143], [146], [149], [154], [156], [159], [167], [169], [172], [180], [182], [185], [193], [195], [198], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [301], [303], [306], [309], [311], [326], [328], [331], [334], [336], [344], [347], [353], [356], [359], [361], [369], [372], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:13:27,644 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:27,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:27,681 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:29,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:29,251 INFO L272 AbstractInterpreter]: Visited 111 different actions 1075 times. Merged at 64 different actions 843 times. Widened at 26 different actions 170 times. Performed 3880 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 107 fixpoints after 23 different actions. Largest state had 153 variables. [2019-09-10 08:13:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:29,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:29,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:29,251 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:13:29,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:29,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:13:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:29,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:13:29,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:29,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:29,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:29,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:13:30,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:30,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:13:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:13:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:13:30,087 INFO L87 Difference]: Start difference. First operand 233204 states and 326727 transitions. Second operand 17 states. [2019-09-10 08:13:40,801 WARN L188 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:13:45,079 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:14:01,530 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:14:03,167 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:14:10,457 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:14:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:39,794 INFO L93 Difference]: Finished difference Result 4384164 states and 6032466 transitions. [2019-09-10 08:14:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 341 states. [2019-09-10 08:14:39,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-10 08:14:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:59,827 INFO L225 Difference]: With dead ends: 4384164 [2019-09-10 08:14:59,828 INFO L226 Difference]: Without dead ends: 4384164 [2019-09-10 08:14:59,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56980 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=14558, Invalid=115402, Unknown=0, NotChecked=0, Total=129960 [2019-09-10 08:15:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384164 states. [2019-09-10 08:15:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384164 to 1193790. [2019-09-10 08:15:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193790 states. [2019-09-10 08:16:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193790 states to 1193790 states and 1665149 transitions. [2019-09-10 08:16:16,517 INFO L78 Accepts]: Start accepts. Automaton has 1193790 states and 1665149 transitions. Word has length 119 [2019-09-10 08:16:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:16,517 INFO L475 AbstractCegarLoop]: Abstraction has 1193790 states and 1665149 transitions. [2019-09-10 08:16:16,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:16:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1193790 states and 1665149 transitions. [2019-09-10 08:16:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:16:16,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:16,537 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, 1, 1, 1, 1] [2019-09-10 08:16:16,538 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 819045295, now seen corresponding path program 1 times [2019-09-10 08:16:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:16:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:16,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:16,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:16,593 INFO L87 Difference]: Start difference. First operand 1193790 states and 1665149 transitions. Second operand 3 states. [2019-09-10 08:16:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:21,269 INFO L93 Difference]: Finished difference Result 1027915 states and 1425534 transitions. [2019-09-10 08:16:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:21,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:16:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:22,633 INFO L225 Difference]: With dead ends: 1027915 [2019-09-10 08:16:22,633 INFO L226 Difference]: Without dead ends: 1027915 [2019-09-10 08:16:22,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027915 states. [2019-09-10 08:16:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027915 to 1027915. [2019-09-10 08:16:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027915 states. [2019-09-10 08:16:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027915 states to 1027915 states and 1425534 transitions. [2019-09-10 08:16:59,474 INFO L78 Accepts]: Start accepts. Automaton has 1027915 states and 1425534 transitions. Word has length 120 [2019-09-10 08:16:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:59,474 INFO L475 AbstractCegarLoop]: Abstraction has 1027915 states and 1425534 transitions. [2019-09-10 08:16:59,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1027915 states and 1425534 transitions. [2019-09-10 08:16:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:16:59,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:59,490 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, 1, 1, 1, 1] [2019-09-10 08:16:59,490 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1726272049, now seen corresponding path program 1 times [2019-09-10 08:16:59,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:16:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:59,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:59,569 INFO L87 Difference]: Start difference. First operand 1027915 states and 1425534 transitions. Second operand 3 states. [2019-09-10 08:17:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:10,077 INFO L93 Difference]: Finished difference Result 878558 states and 1211287 transitions. [2019-09-10 08:17:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:17:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:11,314 INFO L225 Difference]: With dead ends: 878558 [2019-09-10 08:17:11,315 INFO L226 Difference]: Without dead ends: 878558 [2019-09-10 08:17:11,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878558 states. [2019-09-10 08:17:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878558 to 878558. [2019-09-10 08:17:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878558 states. [2019-09-10 08:17:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878558 states to 878558 states and 1211287 transitions. [2019-09-10 08:17:34,590 INFO L78 Accepts]: Start accepts. Automaton has 878558 states and 1211287 transitions. Word has length 120 [2019-09-10 08:17:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:34,590 INFO L475 AbstractCegarLoop]: Abstraction has 878558 states and 1211287 transitions. [2019-09-10 08:17:34,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 878558 states and 1211287 transitions. [2019-09-10 08:17:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:17:34,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:34,602 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, 1, 1, 1, 1] [2019-09-10 08:17:34,602 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1503915619, now seen corresponding path program 1 times [2019-09-10 08:17:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:34,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:34,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:36,881 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 10 [2019-09-10 08:17:37,094 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 08:17:37,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:37,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:37,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 08:17:37,097 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], [125], [128], [133], [136], [141], [143], [146], [154], [156], [159], [167], [169], [172], [175], [178], [180], [182], [185], [193], [195], [198], [201], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [244], [247], [253], [256], [259], [261], [276], [278], [281], [284], [286], [303], [306], [309], [311], [326], [328], [331], [334], [336], [351], [353], [356], [359], [361], [369], [372], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:17:37,102 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:37,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:37,140 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:37,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:37,725 INFO L272 AbstractInterpreter]: Visited 112 different actions 963 times. Merged at 65 different actions 746 times. Widened at 23 different actions 127 times. Performed 3240 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 85 fixpoints after 19 different actions. Largest state had 153 variables. [2019-09-10 08:17:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:37,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:37,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:37,726 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:17:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:37,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:17:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:37,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:17:37,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:37,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:38,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:38,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:17:38,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:17:38,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:17:38,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:17:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:17:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:17:38,567 INFO L87 Difference]: Start difference. First operand 878558 states and 1211287 transitions. Second operand 17 states. [2019-09-10 08:18:01,607 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:18:03,110 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:18:16,923 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 41