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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:25:20,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:25:20,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:25:20,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:25:20,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:25:20,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:25:20,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:25:20,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:25:20,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:25:20,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:25:20,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:25:20,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:25:20,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:25:20,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:25:20,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:25:20,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:25:20,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:25:20,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:25:20,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:25:20,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:25:20,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:25:20,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:25:20,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:25:20,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:25:20,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:25:20,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:25:20,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:25:20,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:25:20,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:25:20,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:25:20,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:25:20,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:25:20,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:25:20,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:25:20,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:25:20,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:25:20,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:25:20,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:25:20,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:25:20,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:25:20,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:25:20,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:25:20,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:25:20,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:25:20,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:25:20,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:25:20,436 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:25:20,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:25:20,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:25:20,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:25:20,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:25:20,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:25:20,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:25:20,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:25:20,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:25:20,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:25:20,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:25:20,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:25:20,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:25:20,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:25:20,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:25:20,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:25:20,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:25:20,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:20,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:25:20,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:25:20,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:25:20,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:25:20,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:25:20,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:25:20,789 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:25:20,789 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:20,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087069a6a/760f28421c5145c185c3b99837de7209/FLAG6c913a23b [2019-10-13 21:25:21,426 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:25:21,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:21,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087069a6a/760f28421c5145c185c3b99837de7209/FLAG6c913a23b [2019-10-13 21:25:21,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087069a6a/760f28421c5145c185c3b99837de7209 [2019-10-13 21:25:21,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:25:21,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:25:21,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:21,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:25:21,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:25:21,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e884bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21, skipping insertion in model container [2019-10-13 21:25:21,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:25:21,856 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:25:22,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:22,156 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:25:22,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:22,331 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:25:22,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22 WrapperNode [2019-10-13 21:25:22,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:22,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:25:22,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:25:22,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:25:22,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (1/1) ... [2019-10-13 21:25:22,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:25:22,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:25:22,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:25:22,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:25:22,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (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-10-13 21:25:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:25:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:25:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 21:25:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 21:25:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 21:25:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 21:25:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 21:25:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:25:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:25:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 21:25:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 21:25:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 21:25:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 21:25:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:25:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:25:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:25:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:25:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:25:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:25:22,484 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:25:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:25:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:25:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 21:25:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 21:25:22,485 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 21:25:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 21:25:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 21:25:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:25:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:25:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:23,356 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:23,356 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:25:23,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:23 BoogieIcfgContainer [2019-10-13 21:25:23,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:23,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:23,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:23,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:23,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:25:21" (1/3) ... [2019-10-13 21:25:23,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f964c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:23, skipping insertion in model container [2019-10-13 21:25:23,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:22" (2/3) ... [2019-10-13 21:25:23,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f964c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:23, skipping insertion in model container [2019-10-13 21:25:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:23" (3/3) ... [2019-10-13 21:25:23,366 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:23,376 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:23,385 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:23,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:23,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:23,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:23,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:23,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:23,425 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:23,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:23,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:23,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-10-13 21:25:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:25:23,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:23,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-10-13 21:25:23,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159125943] [2019-10-13 21:25:23,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:23,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159125943] [2019-10-13 21:25:23,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:23,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454151596] [2019-10-13 21:25:23,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:23,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:23,772 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-10-13 21:25:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,926 INFO L93 Difference]: Finished difference Result 412 states and 673 transitions. [2019-10-13 21:25:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:23,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 21:25:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,943 INFO L225 Difference]: With dead ends: 412 [2019-10-13 21:25:23,943 INFO L226 Difference]: Without dead ends: 212 [2019-10-13 21:25:23,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-13 21:25:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-13 21:25:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-13 21:25:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-10-13 21:25:24,038 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-10-13 21:25:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,039 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-10-13 21:25:24,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-10-13 21:25:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:25:24,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,042 INFO L380 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] [2019-10-13 21:25:24,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-10-13 21:25:24,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610002594] [2019-10-13 21:25:24,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:24,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610002594] [2019-10-13 21:25:24,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586108514] [2019-10-13 21:25:24,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,165 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 4 states. [2019-10-13 21:25:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,269 INFO L93 Difference]: Finished difference Result 427 states and 643 transitions. [2019-10-13 21:25:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-13 21:25:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,278 INFO L225 Difference]: With dead ends: 427 [2019-10-13 21:25:24,279 INFO L226 Difference]: Without dead ends: 226 [2019-10-13 21:25:24,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-13 21:25:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-10-13 21:25:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-13 21:25:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-10-13 21:25:24,341 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-10-13 21:25:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,342 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-10-13 21:25:24,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-10-13 21:25:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:25:24,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,348 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:24,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-10-13 21:25:24,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443555810] [2019-10-13 21:25:24,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:24,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443555810] [2019-10-13 21:25:24,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:24,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835111596] [2019-10-13 21:25:24,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:24,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:24,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:24,515 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 3 states. [2019-10-13 21:25:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,554 INFO L93 Difference]: Finished difference Result 459 states and 689 transitions. [2019-10-13 21:25:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:24,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:25:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,565 INFO L225 Difference]: With dead ends: 459 [2019-10-13 21:25:24,565 INFO L226 Difference]: Without dead ends: 252 [2019-10-13 21:25:24,567 INFO L600 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-10-13 21:25:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-13 21:25:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-10-13 21:25:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-13 21:25:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-10-13 21:25:24,604 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-10-13 21:25:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,605 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-10-13 21:25:24,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-10-13 21:25:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:25:24,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,607 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:24,607 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-10-13 21:25:24,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260661117] [2019-10-13 21:25:24,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:24,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260661117] [2019-10-13 21:25:24,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:24,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902373854] [2019-10-13 21:25:24,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:24,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,715 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 5 states. [2019-10-13 21:25:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,754 INFO L93 Difference]: Finished difference Result 436 states and 647 transitions. [2019-10-13 21:25:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 21:25:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,757 INFO L225 Difference]: With dead ends: 436 [2019-10-13 21:25:24,757 INFO L226 Difference]: Without dead ends: 233 [2019-10-13 21:25:24,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-13 21:25:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-10-13 21:25:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-13 21:25:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-10-13 21:25:24,774 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-10-13 21:25:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,775 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-10-13 21:25:24,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-10-13 21:25:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:25:24,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,777 INFO L380 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] [2019-10-13 21:25:24,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-10-13 21:25:24,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112178289] [2019-10-13 21:25:24,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:24,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112178289] [2019-10-13 21:25:24,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665909646] [2019-10-13 21:25:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,863 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 4 states. [2019-10-13 21:25:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,887 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2019-10-13 21:25:24,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:24,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-13 21:25:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,890 INFO L225 Difference]: With dead ends: 397 [2019-10-13 21:25:24,890 INFO L226 Difference]: Without dead ends: 225 [2019-10-13 21:25:24,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-13 21:25:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-10-13 21:25:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-13 21:25:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-10-13 21:25:24,905 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-10-13 21:25:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,905 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-10-13 21:25:24,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-10-13 21:25:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:25:24,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,907 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:24,908 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-10-13 21:25:24,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280509910] [2019-10-13 21:25:24,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:25:24,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280509910] [2019-10-13 21:25:24,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150739126] [2019-10-13 21:25:24,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,965 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 4 states. [2019-10-13 21:25:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,036 INFO L93 Difference]: Finished difference Result 446 states and 656 transitions. [2019-10-13 21:25:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-13 21:25:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,039 INFO L225 Difference]: With dead ends: 446 [2019-10-13 21:25:25,040 INFO L226 Difference]: Without dead ends: 244 [2019-10-13 21:25:25,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-13 21:25:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-10-13 21:25:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-13 21:25:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-10-13 21:25:25,057 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-10-13 21:25:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,058 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-10-13 21:25:25,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-10-13 21:25:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:25:25,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,060 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:25,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-10-13 21:25:25,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619502876] [2019-10-13 21:25:25,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:25:25,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619502876] [2019-10-13 21:25:25,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:25,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943470388] [2019-10-13 21:25:25,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:25,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:25,167 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 4 states. [2019-10-13 21:25:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,242 INFO L93 Difference]: Finished difference Result 466 states and 684 transitions. [2019-10-13 21:25:25,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-13 21:25:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,246 INFO L225 Difference]: With dead ends: 466 [2019-10-13 21:25:25,246 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 21:25:25,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 21:25:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-13 21:25:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 21:25:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-10-13 21:25:25,271 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-10-13 21:25:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,272 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-10-13 21:25:25,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-10-13 21:25:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:25:25,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,275 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 21:25:25,276 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-10-13 21:25:25,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231699994] [2019-10-13 21:25:25,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:25,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231699994] [2019-10-13 21:25:25,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:25,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339306395] [2019-10-13 21:25:25,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:25,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,394 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 5 states. [2019-10-13 21:25:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,425 INFO L93 Difference]: Finished difference Result 465 states and 671 transitions. [2019-10-13 21:25:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 21:25:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,429 INFO L225 Difference]: With dead ends: 465 [2019-10-13 21:25:25,429 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 21:25:25,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 21:25:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-13 21:25:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 21:25:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-10-13 21:25:25,449 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-10-13 21:25:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,451 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-10-13 21:25:25,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-10-13 21:25:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:25:25,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,453 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 21:25:25,453 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-10-13 21:25:25,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683615709] [2019-10-13 21:25:25,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:25:25,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683615709] [2019-10-13 21:25:25,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:25,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878198214] [2019-10-13 21:25:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:25,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:25,528 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 4 states. [2019-10-13 21:25:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,599 INFO L93 Difference]: Finished difference Result 479 states and 693 transitions. [2019-10-13 21:25:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-13 21:25:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,607 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:25:25,608 INFO L226 Difference]: Without dead ends: 269 [2019-10-13 21:25:25,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-13 21:25:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-10-13 21:25:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-13 21:25:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-10-13 21:25:25,633 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-10-13 21:25:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,633 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-10-13 21:25:25,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-10-13 21:25:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:25:25,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,634 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-13 21:25:25,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-10-13 21:25:25,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578251003] [2019-10-13 21:25:25,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:25:25,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578251003] [2019-10-13 21:25:25,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:25,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525773613] [2019-10-13 21:25:25,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:25,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:25,708 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 4 states. [2019-10-13 21:25:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,765 INFO L93 Difference]: Finished difference Result 486 states and 697 transitions. [2019-10-13 21:25:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:25,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-13 21:25:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,768 INFO L225 Difference]: With dead ends: 486 [2019-10-13 21:25:25,768 INFO L226 Difference]: Without dead ends: 260 [2019-10-13 21:25:25,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-13 21:25:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-13 21:25:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 21:25:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-10-13 21:25:25,784 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-10-13 21:25:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,785 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-10-13 21:25:25,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-10-13 21:25:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:25:25,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,786 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-13 21:25:25,786 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-10-13 21:25:25,787 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932349673] [2019-10-13 21:25:25,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 21:25:25,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932349673] [2019-10-13 21:25:25,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:25,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547724156] [2019-10-13 21:25:25,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:25,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,843 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 5 states. [2019-10-13 21:25:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,867 INFO L93 Difference]: Finished difference Result 473 states and 664 transitions. [2019-10-13 21:25:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-13 21:25:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,870 INFO L225 Difference]: With dead ends: 473 [2019-10-13 21:25:25,870 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 21:25:25,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 21:25:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-13 21:25:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 21:25:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-10-13 21:25:25,882 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-10-13 21:25:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,882 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-10-13 21:25:25,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-10-13 21:25:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:25:25,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,884 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 21:25:25,884 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-10-13 21:25:25,885 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790597726] [2019-10-13 21:25:25,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 21:25:25,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790597726] [2019-10-13 21:25:25,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:25,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190333503] [2019-10-13 21:25:25,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:25,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:25,935 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 4 states. [2019-10-13 21:25:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,998 INFO L93 Difference]: Finished difference Result 462 states and 662 transitions. [2019-10-13 21:25:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:25,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:25:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:26,001 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:25:26,001 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 21:25:26,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 21:25:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-13 21:25:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-13 21:25:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-10-13 21:25:26,013 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-10-13 21:25:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:26,013 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-10-13 21:25:26,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-10-13 21:25:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:25:26,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:26,015 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-13 21:25:26,015 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-10-13 21:25:26,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:26,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868168016] [2019-10-13 21:25:26,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-13 21:25:26,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868168016] [2019-10-13 21:25:26,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822094300] [2019-10-13 21:25:26,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:26,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:25:26,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 21:25:26,305 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-13 21:25:26,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1399299825] [2019-10-13 21:25:26,450 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-10-13 21:25:26,510 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:25:26,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:25:26,636 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:25:26,818 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:25:26,821 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-13 21:25:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,825 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:25:27,101 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-13 21:25:27,101 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:25:27,792 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-13 21:25:27,792 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:25:27,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:25:27,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-10-13 21:25:27,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652060063] [2019-10-13 21:25:27,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:25:27,795 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:27,795 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:25:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:25:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:25:27,796 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 35 states. [2019-10-13 21:25:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:40,255 INFO L93 Difference]: Finished difference Result 621 states and 865 transitions. [2019-10-13 21:25:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-13 21:25:40,256 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-13 21:25:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:40,258 INFO L225 Difference]: With dead ends: 621 [2019-10-13 21:25:40,258 INFO L226 Difference]: Without dead ends: 374 [2019-10-13 21:25:40,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-13 21:25:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-13 21:25:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 306. [2019-10-13 21:25:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-13 21:25:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 404 transitions. [2019-10-13 21:25:40,281 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 404 transitions. Word has length 100 [2019-10-13 21:25:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 404 transitions. [2019-10-13 21:25:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:25:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2019-10-13 21:25:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:25:40,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:40,284 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:40,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:40,493 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-10-13 21:25:40,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:40,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217618621] [2019-10-13 21:25:40,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:40,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217618621] [2019-10-13 21:25:40,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:40,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:40,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880742265] [2019-10-13 21:25:40,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:40,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:40,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:40,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:40,567 INFO L87 Difference]: Start difference. First operand 306 states and 404 transitions. Second operand 5 states. [2019-10-13 21:25:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:40,592 INFO L93 Difference]: Finished difference Result 477 states and 649 transitions. [2019-10-13 21:25:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:40,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-13 21:25:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:40,595 INFO L225 Difference]: With dead ends: 477 [2019-10-13 21:25:40,595 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 21:25:40,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 21:25:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-10-13 21:25:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-13 21:25:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2019-10-13 21:25:40,610 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 144 [2019-10-13 21:25:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:40,610 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2019-10-13 21:25:40,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2019-10-13 21:25:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:25:40,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:40,616 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:40,616 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1526725128, now seen corresponding path program 1 times [2019-10-13 21:25:40,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:40,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108484556] [2019-10-13 21:25:40,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-13 21:25:40,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108484556] [2019-10-13 21:25:40,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984362266] [2019-10-13 21:25:40,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:25:40,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:40,926 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:41,047 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:25:41,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-13 21:25:41,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086867772] [2019-10-13 21:25:41,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:41,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:25:41,049 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand 3 states. [2019-10-13 21:25:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,073 INFO L93 Difference]: Finished difference Result 505 states and 675 transitions. [2019-10-13 21:25:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:41,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:25:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,076 INFO L225 Difference]: With dead ends: 505 [2019-10-13 21:25:41,076 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 21:25:41,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:25:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 21:25:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-13 21:25:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-13 21:25:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 368 transitions. [2019-10-13 21:25:41,090 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 368 transitions. Word has length 153 [2019-10-13 21:25:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,090 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 368 transitions. [2019-10-13 21:25:41,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 368 transitions. [2019-10-13 21:25:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:25:41,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,093 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:41,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:41,298 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 50076921, now seen corresponding path program 1 times [2019-10-13 21:25:41,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748569686] [2019-10-13 21:25:41,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:25:41,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748569686] [2019-10-13 21:25:41,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124031311] [2019-10-13 21:25:41,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,367 INFO L87 Difference]: Start difference. First operand 285 states and 368 transitions. Second operand 4 states. [2019-10-13 21:25:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,396 INFO L93 Difference]: Finished difference Result 455 states and 615 transitions. [2019-10-13 21:25:41,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:41,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:25:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,399 INFO L225 Difference]: With dead ends: 455 [2019-10-13 21:25:41,399 INFO L226 Difference]: Without dead ends: 291 [2019-10-13 21:25:41,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-10-13 21:25:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-10-13 21:25:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-13 21:25:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 371 transitions. [2019-10-13 21:25:41,413 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 371 transitions. Word has length 161 [2019-10-13 21:25:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,414 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 371 transitions. [2019-10-13 21:25:41,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 371 transitions. [2019-10-13 21:25:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-13 21:25:41,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,416 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:41,417 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2129561686, now seen corresponding path program 1 times [2019-10-13 21:25:41,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138549836] [2019-10-13 21:25:41,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:25:41,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138549836] [2019-10-13 21:25:41,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213263750] [2019-10-13 21:25:41,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,494 INFO L87 Difference]: Start difference. First operand 289 states and 371 transitions. Second operand 4 states. [2019-10-13 21:25:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,528 INFO L93 Difference]: Finished difference Result 464 states and 622 transitions. [2019-10-13 21:25:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:41,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-13 21:25:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,531 INFO L225 Difference]: With dead ends: 464 [2019-10-13 21:25:41,531 INFO L226 Difference]: Without dead ends: 296 [2019-10-13 21:25:41,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-13 21:25:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-10-13 21:25:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-13 21:25:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2019-10-13 21:25:41,545 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 173 [2019-10-13 21:25:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,545 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2019-10-13 21:25:41,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2019-10-13 21:25:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-13 21:25:41,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,548 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:41,548 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1138890084, now seen corresponding path program 1 times [2019-10-13 21:25:41,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502648356] [2019-10-13 21:25:41,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-13 21:25:41,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502648356] [2019-10-13 21:25:41,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186850055] [2019-10-13 21:25:41,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,662 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand 4 states. [2019-10-13 21:25:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,726 INFO L93 Difference]: Finished difference Result 466 states and 620 transitions. [2019-10-13 21:25:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:41,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-13 21:25:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,733 INFO L225 Difference]: With dead ends: 466 [2019-10-13 21:25:41,733 INFO L226 Difference]: Without dead ends: 293 [2019-10-13 21:25:41,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-13 21:25:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-10-13 21:25:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-13 21:25:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 370 transitions. [2019-10-13 21:25:41,747 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 370 transitions. Word has length 186 [2019-10-13 21:25:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,748 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 370 transitions. [2019-10-13 21:25:41,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 370 transitions. [2019-10-13 21:25:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-13 21:25:41,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,751 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:41,751 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1259328643, now seen corresponding path program 1 times [2019-10-13 21:25:41,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31770020] [2019-10-13 21:25:41,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-13 21:25:41,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31770020] [2019-10-13 21:25:41,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081295308] [2019-10-13 21:25:41,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,866 INFO L87 Difference]: Start difference. First operand 293 states and 370 transitions. Second operand 4 states. [2019-10-13 21:25:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,889 INFO L93 Difference]: Finished difference Result 464 states and 610 transitions. [2019-10-13 21:25:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:41,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-13 21:25:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,892 INFO L225 Difference]: With dead ends: 464 [2019-10-13 21:25:41,892 INFO L226 Difference]: Without dead ends: 292 [2019-10-13 21:25:41,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-13 21:25:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-13 21:25:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:25:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 367 transitions. [2019-10-13 21:25:41,905 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 367 transitions. Word has length 199 [2019-10-13 21:25:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,905 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 367 transitions. [2019-10-13 21:25:41,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 367 transitions. [2019-10-13 21:25:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-13 21:25:41,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,909 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:41,909 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 714584693, now seen corresponding path program 1 times [2019-10-13 21:25:41,910 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775425137] [2019-10-13 21:25:41,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-13 21:25:42,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775425137] [2019-10-13 21:25:42,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:42,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:42,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752780198] [2019-10-13 21:25:42,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:42,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:42,017 INFO L87 Difference]: Start difference. First operand 292 states and 367 transitions. Second operand 4 states. [2019-10-13 21:25:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:42,322 INFO L93 Difference]: Finished difference Result 782 states and 1044 transitions. [2019-10-13 21:25:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:42,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-13 21:25:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:42,330 INFO L225 Difference]: With dead ends: 782 [2019-10-13 21:25:42,330 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:25:42,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:25:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 475. [2019-10-13 21:25:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-10-13 21:25:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 627 transitions. [2019-10-13 21:25:42,360 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 627 transitions. Word has length 201 [2019-10-13 21:25:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:42,361 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 627 transitions. [2019-10-13 21:25:42,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 627 transitions. [2019-10-13 21:25:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-13 21:25:42,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:42,367 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:42,367 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash -708936932, now seen corresponding path program 1 times [2019-10-13 21:25:42,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:42,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052729183] [2019-10-13 21:25:42,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:42,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052729183] [2019-10-13 21:25:42,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:42,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:42,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401412122] [2019-10-13 21:25:42,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:42,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:42,524 INFO L87 Difference]: Start difference. First operand 475 states and 627 transitions. Second operand 4 states. [2019-10-13 21:25:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:42,759 INFO L93 Difference]: Finished difference Result 1172 states and 1612 transitions. [2019-10-13 21:25:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:42,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-13 21:25:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:42,766 INFO L225 Difference]: With dead ends: 1172 [2019-10-13 21:25:42,766 INFO L226 Difference]: Without dead ends: 818 [2019-10-13 21:25:42,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-13 21:25:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 804. [2019-10-13 21:25:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-10-13 21:25:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1083 transitions. [2019-10-13 21:25:42,827 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1083 transitions. Word has length 236 [2019-10-13 21:25:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1083 transitions. [2019-10-13 21:25:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1083 transitions. [2019-10-13 21:25:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-13 21:25:42,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:42,833 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:42,833 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash 847110771, now seen corresponding path program 1 times [2019-10-13 21:25:42,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:42,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881735114] [2019-10-13 21:25:42,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:42,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881735114] [2019-10-13 21:25:42,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:42,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:42,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585262199] [2019-10-13 21:25:42,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:42,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:42,984 INFO L87 Difference]: Start difference. First operand 804 states and 1083 transitions. Second operand 4 states. [2019-10-13 21:25:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:43,239 INFO L93 Difference]: Finished difference Result 2150 states and 2975 transitions. [2019-10-13 21:25:43,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:43,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-13 21:25:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:43,253 INFO L225 Difference]: With dead ends: 2150 [2019-10-13 21:25:43,253 INFO L226 Difference]: Without dead ends: 1473 [2019-10-13 21:25:43,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-10-13 21:25:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1111. [2019-10-13 21:25:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-13 21:25:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1511 transitions. [2019-10-13 21:25:43,323 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1511 transitions. Word has length 237 [2019-10-13 21:25:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:43,323 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1511 transitions. [2019-10-13 21:25:43,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1511 transitions. [2019-10-13 21:25:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-13 21:25:43,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:43,329 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:43,329 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1622525289, now seen corresponding path program 1 times [2019-10-13 21:25:43,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:43,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185795522] [2019-10-13 21:25:43,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:43,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185795522] [2019-10-13 21:25:43,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:43,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:43,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819600313] [2019-10-13 21:25:43,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:43,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:43,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:43,447 INFO L87 Difference]: Start difference. First operand 1111 states and 1511 transitions. Second operand 4 states. [2019-10-13 21:25:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:43,754 INFO L93 Difference]: Finished difference Result 3098 states and 4298 transitions. [2019-10-13 21:25:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:43,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-13 21:25:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:43,768 INFO L225 Difference]: With dead ends: 3098 [2019-10-13 21:25:43,769 INFO L226 Difference]: Without dead ends: 2114 [2019-10-13 21:25:43,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-13 21:25:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1401. [2019-10-13 21:25:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-13 21:25:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1917 transitions. [2019-10-13 21:25:43,865 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1917 transitions. Word has length 238 [2019-10-13 21:25:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:43,866 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1917 transitions. [2019-10-13 21:25:43,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1917 transitions. [2019-10-13 21:25:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-13 21:25:43,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:43,872 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:43,872 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash 428458709, now seen corresponding path program 1 times [2019-10-13 21:25:43,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:43,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166523613] [2019-10-13 21:25:43,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-13 21:25:43,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166523613] [2019-10-13 21:25:43,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171229091] [2019-10-13 21:25:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:44,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:25:44,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-13 21:25:44,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-13 21:25:44,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1018243351] [2019-10-13 21:25:44,666 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 239 [2019-10-13 21:25:44,678 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:25:44,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:25:44,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:25:44,823 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:25:44,824 INFO L272 AbstractInterpreter]: Visited 123 different actions 327 times. Merged at 21 different actions 64 times. Never widened. Performed 1569 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 1 different actions. Largest state had 90 variables. [2019-10-13 21:25:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:44,824 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:25:45,011 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.4% of their original sizes. [2019-10-13 21:25:45,011 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:25:48,088 INFO L553 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-13 21:25:48,089 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:25:48,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:25:48,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [7, 5, 5] total 83 [2019-10-13 21:25:48,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177830709] [2019-10-13 21:25:48,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-13 21:25:48,090 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:48,091 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:25:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-13 21:25:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=5162, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 21:25:48,095 INFO L87 Difference]: Start difference. First operand 1401 states and 1917 transitions. Second operand 75 states.