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.8.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:47:28,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:47:28,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:47:28,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:47:28,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:47:28,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:47:28,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:47:28,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:47:28,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:47:28,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:47:28,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:47:28,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:47:28,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:47:28,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:47:28,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:47:28,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:47:28,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:47:28,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:47:28,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:47:28,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:47:28,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:47:28,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:47:28,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:47:28,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:47:28,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:47:28,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:47:28,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:47:28,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:47:28,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:47:28,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:47:28,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:47:28,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:47:28,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:47:28,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:47:28,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:47:28,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:47:28,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:47:28,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:47:28,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:47:28,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:47:28,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:47:28,215 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:47:28,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:47:28,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:47:28,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:47:28,231 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:47:28,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:47:28,231 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:47:28,232 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:47:28,232 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:47:28,232 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:47:28,232 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:47:28,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:47:28,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:47:28,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:47:28,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:47:28,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:47:28,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:47:28,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:47:28,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:47:28,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:47:28,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:47:28,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:47:28,235 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:47:28,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:47:28,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:47:28,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:47:28,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:47:28,236 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:47:28,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:47:28,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:47:28,237 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:47:28,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:47:28,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:47:28,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:47:28,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:47:28,281 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:47:28,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:47:28,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f23f844b/78b906ff166346e7be1e3a4377354e0d/FLAG625bf664c [2019-09-10 04:47:28,855 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:47:28,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:47:28,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f23f844b/78b906ff166346e7be1e3a4377354e0d/FLAG625bf664c [2019-09-10 04:47:29,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f23f844b/78b906ff166346e7be1e3a4377354e0d [2019-09-10 04:47:29,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:47:29,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:47:29,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:47:29,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:47:29,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:47:29,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135dd475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29, skipping insertion in model container [2019-09-10 04:47:29,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,187 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:47:29,250 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:47:29,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:47:29,640 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:47:29,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:47:29,738 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:47:29,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29 WrapperNode [2019-09-10 04:47:29,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:47:29,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:47:29,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:47:29,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:47:29,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (1/1) ... [2019-09-10 04:47:29,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:47:29,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:47:29,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:47:29,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:47:29,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (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:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:47:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure node8 [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:47:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:47:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:47:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:47:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 04:47:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:47:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:47:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:47:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:47:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:47:30,706 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:47:30,707 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:47:30,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:47:30 BoogieIcfgContainer [2019-09-10 04:47:30,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:47:30,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:47:30,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:47:30,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:47:30,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:47:29" (1/3) ... [2019-09-10 04:47:30,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb2b2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:47:30, skipping insertion in model container [2019-09-10 04:47:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:29" (2/3) ... [2019-09-10 04:47:30,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb2b2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:47:30, skipping insertion in model container [2019-09-10 04:47:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:47:30" (3/3) ... [2019-09-10 04:47:30,719 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:47:30,728 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:47:30,737 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:47:30,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:47:30,781 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:47:30,781 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:47:30,781 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:47:30,782 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:47:30,782 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:47:30,782 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:47:30,782 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:47:30,782 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:47:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2019-09-10 04:47:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 04:47:30,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:30,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:30,821 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1939199710, now seen corresponding path program 1 times [2019-09-10 04:47:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:30,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:30,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:31,324 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:47:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:31,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:31,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:31,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:31,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:31,349 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 5 states. [2019-09-10 04:47:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:31,526 INFO L93 Difference]: Finished difference Result 187 states and 293 transitions. [2019-09-10 04:47:31,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:47:31,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 04:47:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:31,541 INFO L225 Difference]: With dead ends: 187 [2019-09-10 04:47:31,541 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 04:47:31,543 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:47:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 04:47:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-09-10 04:47:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-10 04:47:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2019-09-10 04:47:31,589 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 82 [2019-09-10 04:47:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:31,590 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2019-09-10 04:47:31,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2019-09-10 04:47:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:47:31,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:31,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:31,597 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1592771534, now seen corresponding path program 1 times [2019-09-10 04:47:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:31,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:32,381 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:47:32,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:32,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 04:47:32,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:32,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 04:47:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 04:47:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-10 04:47:32,386 INFO L87 Difference]: Start difference. First operand 183 states and 229 transitions. Second operand 19 states. [2019-09-10 04:47:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:50,217 INFO L93 Difference]: Finished difference Result 2494 states and 3906 transitions. [2019-09-10 04:47:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 04:47:50,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 142 [2019-09-10 04:47:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:50,256 INFO L225 Difference]: With dead ends: 2494 [2019-09-10 04:47:50,257 INFO L226 Difference]: Without dead ends: 2494 [2019-09-10 04:47:50,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4738 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2532, Invalid=9240, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 04:47:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2019-09-10 04:47:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 1301. [2019-09-10 04:47:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-09-10 04:47:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1866 transitions. [2019-09-10 04:47:50,453 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1866 transitions. Word has length 142 [2019-09-10 04:47:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:50,456 INFO L475 AbstractCegarLoop]: Abstraction has 1301 states and 1866 transitions. [2019-09-10 04:47:50,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 04:47:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1866 transitions. [2019-09-10 04:47:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:50,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:50,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:50,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1197298206, now seen corresponding path program 1 times [2019-09-10 04:47:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:50,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:50,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:50,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:47:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:47:50,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:50,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:47:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:47:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:47:50,621 INFO L87 Difference]: Start difference. First operand 1301 states and 1866 transitions. Second operand 3 states. [2019-09-10 04:47:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:50,667 INFO L93 Difference]: Finished difference Result 2461 states and 3540 transitions. [2019-09-10 04:47:50,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:47:50,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 04:47:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:50,682 INFO L225 Difference]: With dead ends: 2461 [2019-09-10 04:47:50,682 INFO L226 Difference]: Without dead ends: 2461 [2019-09-10 04:47:50,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:47:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-09-10 04:47:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2437. [2019-09-10 04:47:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-09-10 04:47:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3506 transitions. [2019-09-10 04:47:50,756 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3506 transitions. Word has length 144 [2019-09-10 04:47:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:50,756 INFO L475 AbstractCegarLoop]: Abstraction has 2437 states and 3506 transitions. [2019-09-10 04:47:50,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:47:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3506 transitions. [2019-09-10 04:47:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:50,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:50,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:50,761 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1809966634, now seen corresponding path program 1 times [2019-09-10 04:47:50,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:50,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:50,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:50,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:50,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:51,028 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:47:51,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:51,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:51,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:51,030 INFO L87 Difference]: Start difference. First operand 2437 states and 3506 transitions. Second operand 5 states. [2019-09-10 04:47:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:51,820 INFO L93 Difference]: Finished difference Result 4663 states and 6695 transitions. [2019-09-10 04:47:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:51,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:51,855 INFO L225 Difference]: With dead ends: 4663 [2019-09-10 04:47:51,855 INFO L226 Difference]: Without dead ends: 4663 [2019-09-10 04:47:51,856 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:47:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-09-10 04:47:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2019-09-10 04:47:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-09-10 04:47:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6694 transitions. [2019-09-10 04:47:52,074 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6694 transitions. Word has length 144 [2019-09-10 04:47:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:52,076 INFO L475 AbstractCegarLoop]: Abstraction has 4661 states and 6694 transitions. [2019-09-10 04:47:52,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6694 transitions. [2019-09-10 04:47:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:52,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:52,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:52,081 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:52,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1114557792, now seen corresponding path program 1 times [2019-09-10 04:47:52,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:52,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:52,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:52,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:52,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:52,311 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:47:52,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:52,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:52,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:52,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:52,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:52,357 INFO L87 Difference]: Start difference. First operand 4661 states and 6694 transitions. Second operand 5 states. [2019-09-10 04:47:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:53,076 INFO L93 Difference]: Finished difference Result 8961 states and 12827 transitions. [2019-09-10 04:47:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:53,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:53,131 INFO L225 Difference]: With dead ends: 8961 [2019-09-10 04:47:53,131 INFO L226 Difference]: Without dead ends: 8961 [2019-09-10 04:47:53,132 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:47:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-09-10 04:47:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8959. [2019-09-10 04:47:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2019-09-10 04:47:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 12826 transitions. [2019-09-10 04:47:53,484 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 12826 transitions. Word has length 144 [2019-09-10 04:47:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:53,484 INFO L475 AbstractCegarLoop]: Abstraction has 8959 states and 12826 transitions. [2019-09-10 04:47:53,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 12826 transitions. [2019-09-10 04:47:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:53,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:53,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:53,490 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1829234070, now seen corresponding path program 1 times [2019-09-10 04:47:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:53,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:53,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:53,678 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:47:53,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:53,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:53,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:53,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:53,680 INFO L87 Difference]: Start difference. First operand 8959 states and 12826 transitions. Second operand 5 states. [2019-09-10 04:47:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:54,415 INFO L93 Difference]: Finished difference Result 17293 states and 24627 transitions. [2019-09-10 04:47:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:54,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:54,576 INFO L225 Difference]: With dead ends: 17293 [2019-09-10 04:47:54,579 INFO L226 Difference]: Without dead ends: 17293 [2019-09-10 04:47:54,579 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:47:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17293 states. [2019-09-10 04:47:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17293 to 17291. [2019-09-10 04:47:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2019-09-10 04:47:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 24626 transitions. [2019-09-10 04:47:55,027 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 24626 transitions. Word has length 144 [2019-09-10 04:47:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:55,028 INFO L475 AbstractCegarLoop]: Abstraction has 17291 states and 24626 transitions. [2019-09-10 04:47:55,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 24626 transitions. [2019-09-10 04:47:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:55,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:55,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:55,033 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:55,034 INFO L82 PathProgramCache]: Analyzing trace with hash 642579296, now seen corresponding path program 1 times [2019-09-10 04:47:55,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:55,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:55,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:55,209 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:47:55,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:55,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:55,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:55,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:55,212 INFO L87 Difference]: Start difference. First operand 17291 states and 24626 transitions. Second operand 5 states. [2019-09-10 04:47:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:56,026 INFO L93 Difference]: Finished difference Result 33357 states and 47243 transitions. [2019-09-10 04:47:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:56,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:56,177 INFO L225 Difference]: With dead ends: 33357 [2019-09-10 04:47:56,177 INFO L226 Difference]: Without dead ends: 33357 [2019-09-10 04:47:56,178 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:47:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33357 states. [2019-09-10 04:47:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33357 to 33355. [2019-09-10 04:47:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-09-10 04:47:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 47242 transitions. [2019-09-10 04:47:57,495 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 47242 transitions. Word has length 144 [2019-09-10 04:47:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:57,495 INFO L475 AbstractCegarLoop]: Abstraction has 33355 states and 47242 transitions. [2019-09-10 04:47:57,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 47242 transitions. [2019-09-10 04:47:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:57,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:57,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:57,498 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1890088150, now seen corresponding path program 1 times [2019-09-10 04:47:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:57,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:58,151 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:47:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:58,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 04:47:58,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:58,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 04:47:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 04:47:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-10 04:47:58,154 INFO L87 Difference]: Start difference. First operand 33355 states and 47242 transitions. Second operand 19 states. [2019-09-10 04:48:04,544 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-10 04:48:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:15,242 INFO L93 Difference]: Finished difference Result 75515 states and 119962 transitions. [2019-09-10 04:48:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 04:48:15,243 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-10 04:48:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:15,606 INFO L225 Difference]: With dead ends: 75515 [2019-09-10 04:48:15,606 INFO L226 Difference]: Without dead ends: 75515 [2019-09-10 04:48:15,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5072 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2626, Invalid=9364, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 04:48:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75515 states. [2019-09-10 04:48:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75515 to 45051. [2019-09-10 04:48:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45051 states. [2019-09-10 04:48:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45051 states to 45051 states and 63994 transitions. [2019-09-10 04:48:17,774 INFO L78 Accepts]: Start accepts. Automaton has 45051 states and 63994 transitions. Word has length 144 [2019-09-10 04:48:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:17,775 INFO L475 AbstractCegarLoop]: Abstraction has 45051 states and 63994 transitions. [2019-09-10 04:48:17,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 04:48:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45051 states and 63994 transitions. [2019-09-10 04:48:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:48:17,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:17,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:17,780 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:17,782 INFO L82 PathProgramCache]: Analyzing trace with hash -20413614, now seen corresponding path program 1 times [2019-09-10 04:48:17,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:17,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:17,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:17,961 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:48:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:48:17,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:17,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:48:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:48:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:48:17,964 INFO L87 Difference]: Start difference. First operand 45051 states and 63994 transitions. Second operand 9 states. [2019-09-10 04:48:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:19,103 INFO L93 Difference]: Finished difference Result 48114 states and 67111 transitions. [2019-09-10 04:48:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:48:19,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-10 04:48:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:20,314 INFO L225 Difference]: With dead ends: 48114 [2019-09-10 04:48:20,315 INFO L226 Difference]: Without dead ends: 48114 [2019-09-10 04:48:20,315 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:48:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48114 states. [2019-09-10 04:48:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48114 to 45248. [2019-09-10 04:48:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45248 states. [2019-09-10 04:48:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45248 states to 45248 states and 64245 transitions. [2019-09-10 04:48:21,156 INFO L78 Accepts]: Start accepts. Automaton has 45248 states and 64245 transitions. Word has length 144 [2019-09-10 04:48:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:21,157 INFO L475 AbstractCegarLoop]: Abstraction has 45248 states and 64245 transitions. [2019-09-10 04:48:21,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:48:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 45248 states and 64245 transitions. [2019-09-10 04:48:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:48:21,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:21,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:21,160 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash -844227190, now seen corresponding path program 1 times [2019-09-10 04:48:21,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:21,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:21,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:21,291 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:48:21,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:48:21,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:21,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:48:21,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:48:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:48:21,293 INFO L87 Difference]: Start difference. First operand 45248 states and 64245 transitions. Second operand 9 states. [2019-09-10 04:48:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:22,363 INFO L93 Difference]: Finished difference Result 53814 states and 75428 transitions. [2019-09-10 04:48:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:48:22,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-10 04:48:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:22,787 INFO L225 Difference]: With dead ends: 53814 [2019-09-10 04:48:22,788 INFO L226 Difference]: Without dead ends: 53802 [2019-09-10 04:48:22,788 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:48:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53802 states. [2019-09-10 04:48:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53802 to 45301. [2019-09-10 04:48:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45301 states. [2019-09-10 04:48:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45301 states to 45301 states and 64316 transitions. [2019-09-10 04:48:23,763 INFO L78 Accepts]: Start accepts. Automaton has 45301 states and 64316 transitions. Word has length 144 [2019-09-10 04:48:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:23,763 INFO L475 AbstractCegarLoop]: Abstraction has 45301 states and 64316 transitions. [2019-09-10 04:48:23,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:48:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45301 states and 64316 transitions. [2019-09-10 04:48:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:48:23,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:23,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:23,770 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1750236746, now seen corresponding path program 1 times [2019-09-10 04:48:23,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:23,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:23,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:23,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:23,919 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:48:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:48:23,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:23,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:48:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:48:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:48:23,922 INFO L87 Difference]: Start difference. First operand 45301 states and 64316 transitions. Second operand 9 states. [2019-09-10 04:48:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:25,052 INFO L93 Difference]: Finished difference Result 71413 states and 100443 transitions. [2019-09-10 04:48:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:48:25,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-10 04:48:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:25,533 INFO L225 Difference]: With dead ends: 71413 [2019-09-10 04:48:25,534 INFO L226 Difference]: Without dead ends: 71404 [2019-09-10 04:48:25,535 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:48:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71404 states. [2019-09-10 04:48:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71404 to 46972. [2019-09-10 04:48:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46972 states. [2019-09-10 04:48:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46972 states to 46972 states and 66592 transitions. [2019-09-10 04:48:26,551 INFO L78 Accepts]: Start accepts. Automaton has 46972 states and 66592 transitions. Word has length 144 [2019-09-10 04:48:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:26,551 INFO L475 AbstractCegarLoop]: Abstraction has 46972 states and 66592 transitions. [2019-09-10 04:48:26,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:48:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46972 states and 66592 transitions. [2019-09-10 04:48:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:48:26,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:26,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:26,553 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1743971936, now seen corresponding path program 1 times [2019-09-10 04:48:26,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:26,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:26,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:26,729 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:48:26,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:26,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:48:26,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:26,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:48:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:48:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:48:26,731 INFO L87 Difference]: Start difference. First operand 46972 states and 66592 transitions. Second operand 5 states. [2019-09-10 04:48:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:27,644 INFO L93 Difference]: Finished difference Result 69363 states and 97563 transitions. [2019-09-10 04:48:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:48:27,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-10 04:48:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:28,145 INFO L225 Difference]: With dead ends: 69363 [2019-09-10 04:48:28,146 INFO L226 Difference]: Without dead ends: 69363 [2019-09-10 04:48:28,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:48:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69363 states. [2019-09-10 04:48:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69363 to 68463. [2019-09-10 04:48:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68463 states. [2019-09-10 04:48:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68463 states to 68463 states and 96441 transitions. [2019-09-10 04:48:29,116 INFO L78 Accepts]: Start accepts. Automaton has 68463 states and 96441 transitions. Word has length 145 [2019-09-10 04:48:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:29,116 INFO L475 AbstractCegarLoop]: Abstraction has 68463 states and 96441 transitions. [2019-09-10 04:48:29,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:48:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 68463 states and 96441 transitions. [2019-09-10 04:48:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:48:29,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:29,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:29,119 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -96546975, now seen corresponding path program 1 times [2019-09-10 04:48:29,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:29,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:29,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:29,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:29,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:29,231 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:48:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:29,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:48:29,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:29,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:48:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:48:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:48:29,233 INFO L87 Difference]: Start difference. First operand 68463 states and 96441 transitions. Second operand 8 states. [2019-09-10 04:48:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:29,635 INFO L93 Difference]: Finished difference Result 78520 states and 115875 transitions. [2019-09-10 04:48:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:48:29,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-09-10 04:48:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:30,264 INFO L225 Difference]: With dead ends: 78520 [2019-09-10 04:48:30,264 INFO L226 Difference]: Without dead ends: 78520 [2019-09-10 04:48:30,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:48:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78520 states. [2019-09-10 04:48:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78520 to 72063. [2019-09-10 04:48:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72063 states. [2019-09-10 04:48:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72063 states to 72063 states and 100137 transitions. [2019-09-10 04:48:31,716 INFO L78 Accepts]: Start accepts. Automaton has 72063 states and 100137 transitions. Word has length 145 [2019-09-10 04:48:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:31,717 INFO L475 AbstractCegarLoop]: Abstraction has 72063 states and 100137 transitions. [2019-09-10 04:48:31,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:48:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 72063 states and 100137 transitions. [2019-09-10 04:48:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:48:31,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:31,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:31,719 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1430078317, now seen corresponding path program 1 times [2019-09-10 04:48:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:31,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:31,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:31,860 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:48:31,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:31,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:48:31,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:31,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:48:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:48:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:48:31,862 INFO L87 Difference]: Start difference. First operand 72063 states and 100137 transitions. Second operand 9 states. [2019-09-10 04:48:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:33,270 INFO L93 Difference]: Finished difference Result 89993 states and 125874 transitions. [2019-09-10 04:48:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:48:33,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2019-09-10 04:48:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:33,548 INFO L225 Difference]: With dead ends: 89993 [2019-09-10 04:48:33,548 INFO L226 Difference]: Without dead ends: 89981 [2019-09-10 04:48:33,550 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:48:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89981 states. [2019-09-10 04:48:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89981 to 78988. [2019-09-10 04:48:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78988 states. [2019-09-10 04:48:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78988 states to 78988 states and 110353 transitions. [2019-09-10 04:48:35,304 INFO L78 Accepts]: Start accepts. Automaton has 78988 states and 110353 transitions. Word has length 146 [2019-09-10 04:48:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:35,304 INFO L475 AbstractCegarLoop]: Abstraction has 78988 states and 110353 transitions. [2019-09-10 04:48:35,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:48:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78988 states and 110353 transitions. [2019-09-10 04:48:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:48:35,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:35,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:35,306 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 870723943, now seen corresponding path program 1 times [2019-09-10 04:48:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:35,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:35,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:35,428 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:48:35,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:48:35,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:35,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:48:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:48:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:48:35,430 INFO L87 Difference]: Start difference. First operand 78988 states and 110353 transitions. Second operand 5 states. [2019-09-10 04:48:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:36,642 INFO L93 Difference]: Finished difference Result 95813 states and 131906 transitions. [2019-09-10 04:48:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:48:36,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:48:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:36,853 INFO L225 Difference]: With dead ends: 95813 [2019-09-10 04:48:36,854 INFO L226 Difference]: Without dead ends: 95813 [2019-09-10 04:48:36,854 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:48:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95813 states. [2019-09-10 04:48:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95813 to 94176. [2019-09-10 04:48:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94176 states. [2019-09-10 04:48:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94176 states to 94176 states and 129677 transitions. [2019-09-10 04:48:38,036 INFO L78 Accepts]: Start accepts. Automaton has 94176 states and 129677 transitions. Word has length 147 [2019-09-10 04:48:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:38,036 INFO L475 AbstractCegarLoop]: Abstraction has 94176 states and 129677 transitions. [2019-09-10 04:48:38,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:48:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 94176 states and 129677 transitions. [2019-09-10 04:48:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 04:48:38,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:38,066 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, 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] [2019-09-10 04:48:38,066 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1797515352, now seen corresponding path program 1 times [2019-09-10 04:48:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:38,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:38,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 04:48:38,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:48:38,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:48:38,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 04:48:38,188 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], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [367], [368], [369], [371], [380], [389], [391], [398], [401], [406], [409], [413], [426], [428], [429], [430], [460], [465], [467], [469], [470], [473], [489], [491], [493], [496], [500], [502], [503], [506], [522], [524], [526], [529], [533], [535], [536], [539], [555], [557], [559], [562], [566], [568], [569], [570], [571], [594], [597], [601], [603], [604], [607], [610], [615], [618], [625], [627], [630], [634], [636], [637], [640], [642], [645], [647], [648], [651], [667], [669], [671], [674], [678], [680], [681], [704], [707], [711], [713], [717], [718], [719], [720], [721], [722], [723], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [741] [2019-09-10 04:48:38,234 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:48:38,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:48:38,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:48:38,534 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:48:38,536 INFO L272 AbstractInterpreter]: Visited 78 different actions 78 times. Never merged. Never widened. Performed 728 root evaluator evaluations with a maximum evaluation depth of 6. Performed 728 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 173 variables. [2019-09-10 04:48:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:38,540 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:48:38,893 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 76.71% of their original sizes. [2019-09-10 04:48:38,893 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:48:45,886 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 04:48:45,886 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:48:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:48:45,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [5] total 45 [2019-09-10 04:48:45,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:45,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 04:48:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 04:48:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1275, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 04:48:45,890 INFO L87 Difference]: Start difference. First operand 94176 states and 129677 transitions. Second operand 42 states. [2019-09-10 04:49:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:49:07,193 INFO L93 Difference]: Finished difference Result 100371 states and 138680 transitions. [2019-09-10 04:49:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:49:07,193 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 217 [2019-09-10 04:49:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:49:07,658 INFO L225 Difference]: With dead ends: 100371 [2019-09-10 04:49:07,658 INFO L226 Difference]: Without dead ends: 100371 [2019-09-10 04:49:07,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=614, Invalid=1642, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 04:49:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100371 states. [2019-09-10 04:49:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100371 to 100287. [2019-09-10 04:49:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100287 states. [2019-09-10 04:49:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100287 states to 100287 states and 138561 transitions. [2019-09-10 04:49:08,850 INFO L78 Accepts]: Start accepts. Automaton has 100287 states and 138561 transitions. Word has length 217 [2019-09-10 04:49:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:49:08,850 INFO L475 AbstractCegarLoop]: Abstraction has 100287 states and 138561 transitions. [2019-09-10 04:49:08,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 04:49:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 100287 states and 138561 transitions. [2019-09-10 04:49:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 04:49:08,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:49:08,884 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, 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] [2019-09-10 04:49:08,887 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:49:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:49:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash -991971992, now seen corresponding path program 1 times [2019-09-10 04:49:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:49:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:08,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:49:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:08,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:49:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:49:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 04:49:09,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:49:09,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:49:09,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 04:49:09,015 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], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [367], [368], [369], [371], [380], [389], [391], [398], [401], [406], [409], [413], [426], [428], [429], [430], [460], [463], [467], [469], [470], [473], [489], [491], [493], [496], [500], [502], [503], [506], [522], [524], [526], [529], [533], [535], [536], [539], [555], [557], [559], [562], [566], [568], [569], [570], [571], [594], [597], [601], [603], [604], [607], [610], [615], [618], [625], [627], [630], [634], [636], [637], [640], [642], [645], [647], [648], [651], [667], [669], [671], [674], [678], [680], [681], [704], [707], [711], [713], [717], [718], [719], [720], [721], [722], [723], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [741] [2019-09-10 04:49:09,029 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:49:09,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:49:09,062 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:49:15,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:49:15,147 INFO L272 AbstractInterpreter]: Visited 165 different actions 1643 times. Merged at 23 different actions 343 times. Widened at 1 different actions 1 times. Performed 28273 root evaluator evaluations with a maximum evaluation depth of 8. Performed 28273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 79 fixpoints after 8 different actions. Largest state had 173 variables. [2019-09-10 04:49:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:49:15,147 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:49:15,828 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 77.91% of their original sizes. [2019-09-10 04:49:15,828 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:49:26,245 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 04:49:26,246 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:49:26,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:49:26,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [94] imperfect sequences [5] total 97 [2019-09-10 04:49:26,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:49:26,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 04:49:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 04:49:26,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=7941, Unknown=0, NotChecked=0, Total=8742 [2019-09-10 04:49:26,252 INFO L87 Difference]: Start difference. First operand 100287 states and 138561 transitions. Second operand 94 states. [2019-09-10 04:57:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:57:23,488 INFO L93 Difference]: Finished difference Result 150140 states and 216679 transitions. [2019-09-10 04:57:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 323 states. [2019-09-10 04:57:23,488 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 217 [2019-09-10 04:57:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:57:24,079 INFO L225 Difference]: With dead ends: 150140 [2019-09-10 04:57:24,081 INFO L226 Difference]: Without dead ends: 150140 [2019-09-10 04:57:24,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54235 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=10518, Invalid=135024, Unknown=0, NotChecked=0, Total=145542 [2019-09-10 04:57:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150140 states. [2019-09-10 04:57:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150140 to 124049. [2019-09-10 04:57:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124049 states. [2019-09-10 04:57:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124049 states to 124049 states and 171076 transitions. [2019-09-10 04:57:29,280 INFO L78 Accepts]: Start accepts. Automaton has 124049 states and 171076 transitions. Word has length 217 [2019-09-10 04:57:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:57:29,281 INFO L475 AbstractCegarLoop]: Abstraction has 124049 states and 171076 transitions. [2019-09-10 04:57:29,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-10 04:57:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 124049 states and 171076 transitions. [2019-09-10 04:57:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 04:57:29,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:57:29,320 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, 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:57:29,321 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:57:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:57:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 226298794, now seen corresponding path program 1 times [2019-09-10 04:57:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:57:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:57:29,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:57:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:57:29,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:57:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:57:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 04:57:29,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:57:29,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:57:29,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 04:57:29,471 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], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [367], [368], [369], [371], [380], [389], [391], [398], [401], [406], [409], [413], [426], [428], [429], [430], [460], [463], [467], [469], [470], [473], [489], [491], [493], [496], [500], [502], [503], [506], [522], [524], [526], [529], [533], [535], [536], [539], [555], [557], [559], [562], [566], [568], [569], [570], [571], [594], [597], [601], [603], [604], [627], [630], [634], [636], [637], [640], [642], [645], [647], [648], [651], [667], [669], [671], [674], [678], [680], [681], [684], [687], [692], [695], [700], [702], [713], [717], [718], [719], [720], [721], [722], [723], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [741] [2019-09-10 04:57:29,475 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:57:29,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:57:29,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:57:31,223 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:57:31,224 INFO L272 AbstractInterpreter]: Visited 163 different actions 1462 times. Merged at 24 different actions 302 times. Never widened. Performed 27358 root evaluator evaluations with a maximum evaluation depth of 8. Performed 27358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 63 fixpoints after 8 different actions. Largest state had 173 variables. [2019-09-10 04:57:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:57:31,224 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:57:31,647 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 77.62% of their original sizes. [2019-09-10 04:57:31,647 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:57:43,785 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 04:57:43,786 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:57:43,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:57:43,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [94] imperfect sequences [5] total 97 [2019-09-10 04:57:43,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:57:43,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 04:57:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 04:57:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=809, Invalid=7933, Unknown=0, NotChecked=0, Total=8742 [2019-09-10 04:57:43,789 INFO L87 Difference]: Start difference. First operand 124049 states and 171076 transitions. Second operand 94 states.