java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:39:48,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:39:48,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:39:48,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:39:48,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:39:48,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:39:48,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:39:48,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:39:48,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:39:48,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:39:48,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:39:48,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:39:48,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:39:48,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:39:48,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:39:48,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:39:48,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:39:48,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:39:48,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:39:48,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:39:48,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:39:48,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:39:48,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:39:48,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:39:48,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:39:48,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:39:48,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:39:48,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:39:48,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:39:48,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:39:48,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:39:48,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:39:48,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:39:48,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:39:48,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:39:48,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:39:48,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:39:48,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:39:48,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:39:48,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:39:48,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:39:48,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:39:48,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:39:48,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:39:48,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:39:48,820 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:39:48,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:39:48,821 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:39:48,821 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:39:48,821 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:39:48,822 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:39:48,822 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:39:48,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:39:48,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:39:48,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:39:48,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:39:48,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:39:48,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:39:48,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:39:48,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:39:48,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:39:48,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:39:48,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:39:48,825 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:39:48,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:39:48,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:39:48,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:39:48,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:39:48,826 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:39:48,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:39:48,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:39:48,826 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:39:48,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:39:48,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:39:48,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:39:48,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:39:48,872 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:39:48,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2019-09-10 04:39:48,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8ef2f93/48daf20a50554069a1d1266110ad1862/FLAG5fac9bead [2019-09-10 04:39:49,402 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:39:49,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2019-09-10 04:39:49,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8ef2f93/48daf20a50554069a1d1266110ad1862/FLAG5fac9bead [2019-09-10 04:39:49,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8ef2f93/48daf20a50554069a1d1266110ad1862 [2019-09-10 04:39:49,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:39:49,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:39:49,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:39:49,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:39:49,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:39:49,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:39:49" (1/1) ... [2019-09-10 04:39:49,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d37676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:49, skipping insertion in model container [2019-09-10 04:39:49,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:39:49" (1/1) ... [2019-09-10 04:39:49,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:39:49,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:39:50,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:39:50,331 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:39:50,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:39:50,419 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:39:50,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50 WrapperNode [2019-09-10 04:39:50,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:39:50,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:39:50,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:39:50,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:39:50,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... [2019-09-10 04:39:50,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:39:50,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:39:50,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:39:50,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:39:50,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:39:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:39:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:39:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:39:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:39:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:39:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:39:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:39:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:39:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:39:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:39:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:39:51,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:39:51,376 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:39:51,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:39:51 BoogieIcfgContainer [2019-09-10 04:39:51,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:39:51,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:39:51,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:39:51,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:39:51,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:39:49" (1/3) ... [2019-09-10 04:39:51,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a96a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:39:51, skipping insertion in model container [2019-09-10 04:39:51,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:39:50" (2/3) ... [2019-09-10 04:39:51,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a96a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:39:51, skipping insertion in model container [2019-09-10 04:39:51,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:39:51" (3/3) ... [2019-09-10 04:39:51,388 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2019-09-10 04:39:51,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:39:51,409 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:39:51,426 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:39:51,460 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:39:51,460 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:39:51,460 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:39:51,461 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:39:51,461 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:39:51,461 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:39:51,461 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:39:51,461 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:39:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-10 04:39:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 04:39:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:51,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:39:51,510 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1658309622, now seen corresponding path program 1 times [2019-09-10 04:39:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:51,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:51,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:39:52,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:52,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:39:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:39:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:39:52,166 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 5 states. [2019-09-10 04:39:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:52,337 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2019-09-10 04:39:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:39:52,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 04:39:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:52,353 INFO L225 Difference]: With dead ends: 169 [2019-09-10 04:39:52,353 INFO L226 Difference]: Without dead ends: 160 [2019-09-10 04:39:52,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:39:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-10 04:39:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-10 04:39:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 04:39:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2019-09-10 04:39:52,413 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 75 [2019-09-10 04:39:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:52,413 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2019-09-10 04:39:52,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:39:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2019-09-10 04:39:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:39:52,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:52,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:39:52,420 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -456402126, now seen corresponding path program 1 times [2019-09-10 04:39:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:52,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:52,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:39:53,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:53,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:39:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:39:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:39:53,083 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand 17 states. [2019-09-10 04:40:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:07,796 INFO L93 Difference]: Finished difference Result 2073 states and 3253 transitions. [2019-09-10 04:40:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:40:07,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-09-10 04:40:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:07,844 INFO L225 Difference]: With dead ends: 2073 [2019-09-10 04:40:07,844 INFO L226 Difference]: Without dead ends: 2073 [2019-09-10 04:40:07,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1998, Invalid=7122, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:40:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-09-10 04:40:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1059. [2019-09-10 04:40:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-10 04:40:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1507 transitions. [2019-09-10 04:40:08,071 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1507 transitions. Word has length 124 [2019-09-10 04:40:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:08,074 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1507 transitions. [2019-09-10 04:40:08,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:40:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1507 transitions. [2019-09-10 04:40:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:08,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:08,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:08,087 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1039057762, now seen corresponding path program 1 times [2019-09-10 04:40:08,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:08,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:08,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:08,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:08,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:08,269 INFO L87 Difference]: Start difference. First operand 1059 states and 1507 transitions. Second operand 5 states. [2019-09-10 04:40:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:09,021 INFO L93 Difference]: Finished difference Result 2867 states and 4083 transitions. [2019-09-10 04:40:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:09,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:09,038 INFO L225 Difference]: With dead ends: 2867 [2019-09-10 04:40:09,038 INFO L226 Difference]: Without dead ends: 2867 [2019-09-10 04:40:09,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:40:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-10 04:40:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2863. [2019-09-10 04:40:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2019-09-10 04:40:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 4081 transitions. [2019-09-10 04:40:09,150 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 4081 transitions. Word has length 126 [2019-09-10 04:40:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:09,151 INFO L475 AbstractCegarLoop]: Abstraction has 2863 states and 4081 transitions. [2019-09-10 04:40:09,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4081 transitions. [2019-09-10 04:40:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:09,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:09,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:09,157 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash -248644694, now seen corresponding path program 1 times [2019-09-10 04:40:09,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:09,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:09,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:09,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:09,323 INFO L87 Difference]: Start difference. First operand 2863 states and 4081 transitions. Second operand 5 states. [2019-09-10 04:40:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:09,905 INFO L93 Difference]: Finished difference Result 5463 states and 7771 transitions. [2019-09-10 04:40:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:09,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:09,937 INFO L225 Difference]: With dead ends: 5463 [2019-09-10 04:40:09,938 INFO L226 Difference]: Without dead ends: 5463 [2019-09-10 04:40:09,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-09-10 04:40:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5461. [2019-09-10 04:40:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2019-09-10 04:40:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 7770 transitions. [2019-09-10 04:40:10,150 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 7770 transitions. Word has length 126 [2019-09-10 04:40:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:10,151 INFO L475 AbstractCegarLoop]: Abstraction has 5461 states and 7770 transitions. [2019-09-10 04:40:10,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 7770 transitions. [2019-09-10 04:40:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:10,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:10,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:10,156 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 947100576, now seen corresponding path program 1 times [2019-09-10 04:40:10,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:10,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:10,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:10,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:10,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:10,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:10,343 INFO L87 Difference]: Start difference. First operand 5461 states and 7770 transitions. Second operand 5 states. [2019-09-10 04:40:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:10,996 INFO L93 Difference]: Finished difference Result 10494 states and 14832 transitions. [2019-09-10 04:40:10,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:10,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:11,062 INFO L225 Difference]: With dead ends: 10494 [2019-09-10 04:40:11,063 INFO L226 Difference]: Without dead ends: 10494 [2019-09-10 04:40:11,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2019-09-10 04:40:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 10492. [2019-09-10 04:40:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10492 states. [2019-09-10 04:40:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 14831 transitions. [2019-09-10 04:40:11,446 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 14831 transitions. Word has length 126 [2019-09-10 04:40:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:11,446 INFO L475 AbstractCegarLoop]: Abstraction has 10492 states and 14831 transitions. [2019-09-10 04:40:11,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 14831 transitions. [2019-09-10 04:40:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:11,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:11,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:11,452 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1143879702, now seen corresponding path program 1 times [2019-09-10 04:40:11,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:11,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:11,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:11,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:11,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:11,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:11,765 INFO L87 Difference]: Start difference. First operand 10492 states and 14831 transitions. Second operand 5 states. [2019-09-10 04:40:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:12,375 INFO L93 Difference]: Finished difference Result 20154 states and 28296 transitions. [2019-09-10 04:40:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:12,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:12,469 INFO L225 Difference]: With dead ends: 20154 [2019-09-10 04:40:12,469 INFO L226 Difference]: Without dead ends: 20154 [2019-09-10 04:40:12,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20154 states. [2019-09-10 04:40:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20154 to 20152. [2019-09-10 04:40:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20152 states. [2019-09-10 04:40:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20152 states to 20152 states and 28295 transitions. [2019-09-10 04:40:13,016 INFO L78 Accepts]: Start accepts. Automaton has 20152 states and 28295 transitions. Word has length 126 [2019-09-10 04:40:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:13,018 INFO L475 AbstractCegarLoop]: Abstraction has 20152 states and 28295 transitions. [2019-09-10 04:40:13,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20152 states and 28295 transitions. [2019-09-10 04:40:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:13,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:13,021 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:13,021 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1799912160, now seen corresponding path program 1 times [2019-09-10 04:40:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:13,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:13,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:13,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:13,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:13,194 INFO L87 Difference]: Start difference. First operand 20152 states and 28295 transitions. Second operand 5 states. [2019-09-10 04:40:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:13,891 INFO L93 Difference]: Finished difference Result 38778 states and 53992 transitions. [2019-09-10 04:40:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:13,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:14,069 INFO L225 Difference]: With dead ends: 38778 [2019-09-10 04:40:14,069 INFO L226 Difference]: Without dead ends: 38778 [2019-09-10 04:40:14,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38778 states. [2019-09-10 04:40:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38778 to 38776. [2019-09-10 04:40:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38776 states. [2019-09-10 04:40:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38776 states to 38776 states and 53991 transitions. [2019-09-10 04:40:15,578 INFO L78 Accepts]: Start accepts. Automaton has 38776 states and 53991 transitions. Word has length 126 [2019-09-10 04:40:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:15,579 INFO L475 AbstractCegarLoop]: Abstraction has 38776 states and 53991 transitions. [2019-09-10 04:40:15,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38776 states and 53991 transitions. [2019-09-10 04:40:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:15,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:15,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:15,581 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 613257386, now seen corresponding path program 1 times [2019-09-10 04:40:15,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:15,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:15,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:15,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:15,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:15,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:15,854 INFO L87 Difference]: Start difference. First operand 38776 states and 53991 transitions. Second operand 5 states. [2019-09-10 04:40:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:16,692 INFO L93 Difference]: Finished difference Result 74418 states and 102752 transitions. [2019-09-10 04:40:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:16,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:16,924 INFO L225 Difference]: With dead ends: 74418 [2019-09-10 04:40:16,924 INFO L226 Difference]: Without dead ends: 74418 [2019-09-10 04:40:16,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74418 states. [2019-09-10 04:40:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74418 to 74416. [2019-09-10 04:40:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74416 states. [2019-09-10 04:40:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74416 states to 74416 states and 102751 transitions. [2019-09-10 04:40:18,806 INFO L78 Accepts]: Start accepts. Automaton has 74416 states and 102751 transitions. Word has length 126 [2019-09-10 04:40:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 74416 states and 102751 transitions. [2019-09-10 04:40:18,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 74416 states and 102751 transitions. [2019-09-10 04:40:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:18,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:18,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:18,809 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1860766240, now seen corresponding path program 1 times [2019-09-10 04:40:18,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:18,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:18,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:18,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:40:18,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:18,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:40:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:40:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:40:18,922 INFO L87 Difference]: Start difference. First operand 74416 states and 102751 transitions. Second operand 5 states. [2019-09-10 04:40:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:21,328 INFO L93 Difference]: Finished difference Result 142338 states and 194912 transitions. [2019-09-10 04:40:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:40:21,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:40:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:21,702 INFO L225 Difference]: With dead ends: 142338 [2019-09-10 04:40:21,702 INFO L226 Difference]: Without dead ends: 142338 [2019-09-10 04:40:21,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:40:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142338 states. [2019-09-10 04:40:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142338 to 142336. [2019-09-10 04:40:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142336 states. [2019-09-10 04:40:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142336 states to 142336 states and 194911 transitions. [2019-09-10 04:40:24,662 INFO L78 Accepts]: Start accepts. Automaton has 142336 states and 194911 transitions. Word has length 126 [2019-09-10 04:40:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:24,663 INFO L475 AbstractCegarLoop]: Abstraction has 142336 states and 194911 transitions. [2019-09-10 04:40:24,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:40:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 142336 states and 194911 transitions. [2019-09-10 04:40:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:24,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:24,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:24,665 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 222538090, now seen corresponding path program 1 times [2019-09-10 04:40:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:24,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:24,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:25,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:25,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:40:25,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:25,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:40:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:40:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:40:25,054 INFO L87 Difference]: Start difference. First operand 142336 states and 194911 transitions. Second operand 17 states. [2019-09-10 04:40:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:42,673 INFO L93 Difference]: Finished difference Result 326588 states and 511949 transitions. [2019-09-10 04:40:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:40:42,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 04:40:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:47,381 INFO L225 Difference]: With dead ends: 326588 [2019-09-10 04:40:47,381 INFO L226 Difference]: Without dead ends: 326588 [2019-09-10 04:40:47,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3713 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2040, Invalid=7080, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:40:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326588 states. [2019-09-10 04:40:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326588 to 194752. [2019-09-10 04:40:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194752 states. [2019-09-10 04:40:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194752 states to 194752 states and 267039 transitions. [2019-09-10 04:40:54,847 INFO L78 Accepts]: Start accepts. Automaton has 194752 states and 267039 transitions. Word has length 126 [2019-09-10 04:40:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:54,851 INFO L475 AbstractCegarLoop]: Abstraction has 194752 states and 267039 transitions. [2019-09-10 04:40:54,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:40:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 194752 states and 267039 transitions. [2019-09-10 04:40:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:40:54,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:54,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:54,853 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash 463021734, now seen corresponding path program 1 times [2019-09-10 04:40:54,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:54,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:54,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:54,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:54,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:40:54,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:40:54,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:54,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:40:54,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:40:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:40:54,986 INFO L87 Difference]: Start difference. First operand 194752 states and 267039 transitions. Second operand 9 states. [2019-09-10 04:41:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:00,162 INFO L93 Difference]: Finished difference Result 240003 states and 330523 transitions. [2019-09-10 04:41:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:41:00,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-10 04:41:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:00,924 INFO L225 Difference]: With dead ends: 240003 [2019-09-10 04:41:00,924 INFO L226 Difference]: Without dead ends: 240003 [2019-09-10 04:41:00,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:41:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240003 states. [2019-09-10 04:41:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240003 to 219845. [2019-09-10 04:41:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219845 states. [2019-09-10 04:41:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219845 states to 219845 states and 302543 transitions. [2019-09-10 04:41:05,055 INFO L78 Accepts]: Start accepts. Automaton has 219845 states and 302543 transitions. Word has length 126 [2019-09-10 04:41:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:05,055 INFO L475 AbstractCegarLoop]: Abstraction has 219845 states and 302543 transitions. [2019-09-10 04:41:05,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:41:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 219845 states and 302543 transitions. [2019-09-10 04:41:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:41:05,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:05,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:41:05,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1528434433, now seen corresponding path program 1 times [2019-09-10 04:41:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:05,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:05,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:41:09,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:41:09,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:41:09,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:09,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:41:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:41:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:41:09,105 INFO L87 Difference]: Start difference. First operand 219845 states and 302543 transitions. Second operand 11 states. [2019-09-10 04:41:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:10,231 INFO L93 Difference]: Finished difference Result 255400 states and 369491 transitions. [2019-09-10 04:41:10,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:41:10,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-10 04:41:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:10,884 INFO L225 Difference]: With dead ends: 255400 [2019-09-10 04:41:10,884 INFO L226 Difference]: Without dead ends: 255400 [2019-09-10 04:41:10,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:41:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255400 states. [2019-09-10 04:41:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255400 to 232517. [2019-09-10 04:41:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232517 states. [2019-09-10 04:41:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232517 states to 232517 states and 315535 transitions. [2019-09-10 04:41:16,781 INFO L78 Accepts]: Start accepts. Automaton has 232517 states and 315535 transitions. Word has length 127 [2019-09-10 04:41:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:16,781 INFO L475 AbstractCegarLoop]: Abstraction has 232517 states and 315535 transitions. [2019-09-10 04:41:16,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:41:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 232517 states and 315535 transitions. [2019-09-10 04:41:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:41:16,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:16,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:41:16,783 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 346953462, now seen corresponding path program 1 times [2019-09-10 04:41:16,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:16,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:16,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:41:16,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:41:16,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:41:16,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:16,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:41:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:41:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:41:16,957 INFO L87 Difference]: Start difference. First operand 232517 states and 315535 transitions. Second operand 7 states. [2019-09-10 04:41:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:18,619 INFO L93 Difference]: Finished difference Result 328606 states and 445669 transitions. [2019-09-10 04:41:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:41:18,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-10 04:41:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:19,313 INFO L225 Difference]: With dead ends: 328606 [2019-09-10 04:41:19,314 INFO L226 Difference]: Without dead ends: 328606 [2019-09-10 04:41:19,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:41:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328606 states. [2019-09-10 04:41:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328606 to 303557. [2019-09-10 04:41:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303557 states. [2019-09-10 04:41:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303557 states to 303557 states and 410221 transitions. [2019-09-10 04:41:30,517 INFO L78 Accepts]: Start accepts. Automaton has 303557 states and 410221 transitions. Word has length 127 [2019-09-10 04:41:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:30,517 INFO L475 AbstractCegarLoop]: Abstraction has 303557 states and 410221 transitions. [2019-09-10 04:41:30,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:41:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 303557 states and 410221 transitions. [2019-09-10 04:41:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:41:30,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:30,628 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:41:30,628 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash -598279232, now seen corresponding path program 1 times [2019-09-10 04:41:30,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:30,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:30,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:30,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:41:30,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:41:30,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:41:30,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:41:30,744 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [561], [563], [565], [568], [572], [574], [575], [578], [581], [586], [589], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:41:30,820 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:41:30,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:41:31,007 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:41:34,912 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:41:34,916 INFO L272 AbstractInterpreter]: Visited 151 different actions 2398 times. Merged at 25 different actions 560 times. Widened at 1 different actions 4 times. Performed 31934 root evaluator evaluations with a maximum evaluation depth of 7. Performed 31934 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 143 fixpoints after 8 different actions. Largest state had 154 variables. [2019-09-10 04:41:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:34,923 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:41:35,800 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 77.87% of their original sizes. [2019-09-10 04:41:35,801 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:41:51,291 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:41:51,292 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:41:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:41:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [5] total 105 [2019-09-10 04:41:51,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:51,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 04:41:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 04:41:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=854, Invalid=9448, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 04:41:51,303 INFO L87 Difference]: Start difference. First operand 303557 states and 410221 transitions. Second operand 102 states. [2019-09-10 04:44:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:23,872 INFO L93 Difference]: Finished difference Result 253732 states and 366852 transitions. [2019-09-10 04:44:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-09-10 04:44:23,872 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 193 [2019-09-10 04:44:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:24,905 INFO L225 Difference]: With dead ends: 253732 [2019-09-10 04:44:24,905 INFO L226 Difference]: Without dead ends: 253726 [2019-09-10 04:44:24,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20964 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=4756, Invalid=60014, Unknown=0, NotChecked=0, Total=64770 [2019-09-10 04:44:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253726 states. [2019-09-10 04:44:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253726 to 224264. [2019-09-10 04:44:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224264 states. [2019-09-10 04:44:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224264 states to 224264 states and 303060 transitions. [2019-09-10 04:44:32,713 INFO L78 Accepts]: Start accepts. Automaton has 224264 states and 303060 transitions. Word has length 193 [2019-09-10 04:44:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:32,713 INFO L475 AbstractCegarLoop]: Abstraction has 224264 states and 303060 transitions. [2019-09-10 04:44:32,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 04:44:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 224264 states and 303060 transitions. [2019-09-10 04:44:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:44:32,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:32,833 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:44:32,833 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1748263958, now seen corresponding path program 1 times [2019-09-10 04:44:32,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:32,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:44:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:33,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:33,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:44:33,376 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [367], [370], [375], [378], [385], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [561], [563], [565], [568], [572], [574], [575], [578], [594], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:44:33,383 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:33,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:33,402 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:44:37,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:44:37,061 INFO L272 AbstractInterpreter]: Visited 154 different actions 3226 times. Merged at 27 different actions 800 times. Widened at 1 different actions 6 times. Performed 42012 root evaluator evaluations with a maximum evaluation depth of 7. Performed 42012 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 218 fixpoints after 10 different actions. Largest state had 154 variables. [2019-09-10 04:44:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:37,061 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:44:37,525 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 83.54% of their original sizes. [2019-09-10 04:44:37,525 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:45:03,561 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:45:03,562 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:45:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:45:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [110] imperfect sequences [21] total 129 [2019-09-10 04:45:03,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:45:03,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-10 04:45:03,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-10 04:45:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1422, Invalid=10568, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 04:45:03,566 INFO L87 Difference]: Start difference. First operand 224264 states and 303060 transitions. Second operand 110 states. [2019-09-10 04:48:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:45,014 INFO L93 Difference]: Finished difference Result 267812 states and 388150 transitions. [2019-09-10 04:48:45,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-10 04:48:45,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 193 [2019-09-10 04:48:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:45,902 INFO L225 Difference]: With dead ends: 267812 [2019-09-10 04:48:45,903 INFO L226 Difference]: Without dead ends: 267812 [2019-09-10 04:48:45,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11169 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=2684, Invalid=27766, Unknown=0, NotChecked=0, Total=30450 [2019-09-10 04:48:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267812 states. [2019-09-10 04:48:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267812 to 240664. [2019-09-10 04:48:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240664 states. [2019-09-10 04:48:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240664 states to 240664 states and 325006 transitions. [2019-09-10 04:48:51,365 INFO L78 Accepts]: Start accepts. Automaton has 240664 states and 325006 transitions. Word has length 193 [2019-09-10 04:48:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:51,366 INFO L475 AbstractCegarLoop]: Abstraction has 240664 states and 325006 transitions. [2019-09-10 04:48:51,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-10 04:48:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 240664 states and 325006 transitions. [2019-09-10 04:48:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:48:51,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:51,410 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:51,410 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1817043562, now seen corresponding path program 1 times [2019-09-10 04:48:51,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:51,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:51,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:48:51,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:48:51,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:48:51,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:48:51,844 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [326], [332], [335], [340], [343], [347], [360], [362], [363], [364], [367], [383], [385], [387], [390], [394], [396], [397], [400], [416], [418], [420], [423], [427], [429], [430], [433], [449], [451], [453], [456], [460], [462], [463], [466], [482], [484], [486], [489], [493], [495], [496], [497], [498], [501], [517], [519], [521], [524], [528], [530], [531], [534], [536], [539], [541], [542], [545], [548], [553], [556], [563], [565], [568], [572], [574], [575], [578], [594], [596], [598], [601], [605], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633] [2019-09-10 04:48:51,850 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:48:51,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:48:51,871 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:48:59,336 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:48:59,337 INFO L272 AbstractInterpreter]: Visited 154 different actions 2962 times. Merged at 27 different actions 706 times. Widened at 1 different actions 5 times. Performed 39355 root evaluator evaluations with a maximum evaluation depth of 7. Performed 39355 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 186 fixpoints after 10 different actions. Largest state had 154 variables. [2019-09-10 04:48:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:59,337 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:48:59,708 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 78.07% of their original sizes. [2019-09-10 04:48:59,709 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:49:11,021 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 04:49:11,021 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:49:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:49:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [104] imperfect sequences [21] total 123 [2019-09-10 04:49:11,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:49:11,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-10 04:49:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-10 04:49:11,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=9841, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 04:49:11,024 INFO L87 Difference]: Start difference. First operand 240664 states and 325006 transitions. Second operand 104 states.