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.6.1.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:35:05,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:35:05,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:35:05,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:35:05,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:35:06,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:35:06,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:35:06,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:35:06,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:35:06,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:35:06,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:35:06,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:35:06,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:35:06,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:35:06,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:35:06,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:35:06,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:35:06,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:35:06,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:35:06,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:35:06,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:35:06,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:35:06,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:35:06,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:35:06,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:35:06,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:35:06,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:35:06,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:35:06,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:35:06,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:35:06,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:35:06,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:35:06,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:35:06,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:35:06,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:35:06,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:35:06,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:35:06,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:35:06,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:35:06,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:35:06,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:35:06,044 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:35:06,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:35:06,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:35:06,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:35:06,068 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:35:06,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:35:06,069 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:35:06,070 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:35:06,070 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:35:06,070 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:35:06,070 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:35:06,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:35:06,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:35:06,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:35:06,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:35:06,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:35:06,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:35:06,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:35:06,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:35:06,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:35:06,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:35:06,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:35:06,073 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:35:06,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:35:06,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:35:06,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:35:06,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:35:06,074 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:35:06,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:35:06,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:35:06,075 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:35:06,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:35:06,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:35:06,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:35:06,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:35:06,135 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:35:06,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:06,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e251ce3/30a716d209df46cc976f4efaf1632993/FLAG6d6a5080d [2019-09-10 04:35:06,686 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:35:06,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:06,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e251ce3/30a716d209df46cc976f4efaf1632993/FLAG6d6a5080d [2019-09-10 04:35:06,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e251ce3/30a716d209df46cc976f4efaf1632993 [2019-09-10 04:35:06,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:35:06,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:35:06,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:35:06,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:35:06,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:35:06,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:35:06" (1/1) ... [2019-09-10 04:35:06,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f04eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:06, skipping insertion in model container [2019-09-10 04:35:06,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:35:06" (1/1) ... [2019-09-10 04:35:06,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:35:07,041 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:35:07,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:35:07,388 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:35:07,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:35:07,467 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:35:07,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07 WrapperNode [2019-09-10 04:35:07,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:35:07,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:35:07,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:35:07,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:35:07,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (1/1) ... [2019-09-10 04:35:07,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:35:07,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:35:07,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:35:07,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:35:07,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (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:35:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:35:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:35:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:35:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:35:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:35:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:35:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:35:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:35:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:35:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:35:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:35:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:35:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:35:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:35:08,325 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:35:08,326 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:35:08,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:35:08 BoogieIcfgContainer [2019-09-10 04:35:08,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:35:08,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:35:08,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:35:08,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:35:08,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:35:06" (1/3) ... [2019-09-10 04:35:08,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52eb4725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:35:08, skipping insertion in model container [2019-09-10 04:35:08,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:07" (2/3) ... [2019-09-10 04:35:08,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52eb4725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:35:08, skipping insertion in model container [2019-09-10 04:35:08,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:35:08" (3/3) ... [2019-09-10 04:35:08,336 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:08,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:35:08,351 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:35:08,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:35:08,389 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:35:08,389 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:35:08,389 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:35:08,390 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:35:08,390 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:35:08,390 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:35:08,390 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:35:08,390 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:35:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-10 04:35:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 04:35:08,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:08,425 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] [2019-09-10 04:35:08,427 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:08,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1413295764, now seen corresponding path program 1 times [2019-09-10 04:35:08,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:08,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:08,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:08,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:08,890 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:35:08,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:08,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:08,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:08,921 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-10 04:35:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:09,082 INFO L93 Difference]: Finished difference Result 148 states and 222 transitions. [2019-09-10 04:35:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:35:09,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 04:35:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:09,099 INFO L225 Difference]: With dead ends: 148 [2019-09-10 04:35:09,099 INFO L226 Difference]: Without dead ends: 139 [2019-09-10 04:35:09,101 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:35:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-10 04:35:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-10 04:35:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-10 04:35:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-09-10 04:35:09,148 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 68 [2019-09-10 04:35:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:09,149 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-09-10 04:35:09,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-09-10 04:35:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 04:35:09,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:09,153 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] [2019-09-10 04:35:09,154 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:09,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1130534395, now seen corresponding path program 1 times [2019-09-10 04:35:09,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:09,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:09,710 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:35:09,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:09,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:35:09,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:09,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:35:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:35:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:35:09,716 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-09-10 04:35:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:18,988 INFO L93 Difference]: Finished difference Result 1485 states and 2286 transitions. [2019-09-10 04:35:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:35:18,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-10 04:35:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:19,009 INFO L225 Difference]: With dead ends: 1485 [2019-09-10 04:35:19,009 INFO L226 Difference]: Without dead ends: 1485 [2019-09-10 04:35:19,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:35:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-10 04:35:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1121. [2019-09-10 04:35:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-10 04:35:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1601 transitions. [2019-09-10 04:35:19,190 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1601 transitions. Word has length 107 [2019-09-10 04:35:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:19,193 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1601 transitions. [2019-09-10 04:35:19,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:35:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1601 transitions. [2019-09-10 04:35:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:19,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:19,207 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] [2019-09-10 04:35:19,207 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2055527989, now seen corresponding path program 1 times [2019-09-10 04:35:19,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:19,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:19,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:35:19,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:19,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:35:19,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:19,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:35:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:35:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:35:19,313 INFO L87 Difference]: Start difference. First operand 1121 states and 1601 transitions. Second operand 3 states. [2019-09-10 04:35:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:19,352 INFO L93 Difference]: Finished difference Result 2113 states and 3018 transitions. [2019-09-10 04:35:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:35:19,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 04:35:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:19,365 INFO L225 Difference]: With dead ends: 2113 [2019-09-10 04:35:19,365 INFO L226 Difference]: Without dead ends: 2113 [2019-09-10 04:35:19,366 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:35:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-09-10 04:35:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2019-09-10 04:35:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-10 04:35:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3017 transitions. [2019-09-10 04:35:19,439 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3017 transitions. Word has length 109 [2019-09-10 04:35:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:19,439 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3017 transitions. [2019-09-10 04:35:19,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:35:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3017 transitions. [2019-09-10 04:35:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:19,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:19,443 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] [2019-09-10 04:35:19,443 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 951736851, now seen corresponding path program 1 times [2019-09-10 04:35:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:19,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:19,596 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:35:19,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:19,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:19,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:19,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:19,598 INFO L87 Difference]: Start difference. First operand 2111 states and 3017 transitions. Second operand 5 states. [2019-09-10 04:35:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:20,210 INFO L93 Difference]: Finished difference Result 3266 states and 4616 transitions. [2019-09-10 04:35:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:20,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:20,233 INFO L225 Difference]: With dead ends: 3266 [2019-09-10 04:35:20,233 INFO L226 Difference]: Without dead ends: 3266 [2019-09-10 04:35:20,234 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:35:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-09-10 04:35:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3264. [2019-09-10 04:35:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2019-09-10 04:35:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4615 transitions. [2019-09-10 04:35:20,339 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4615 transitions. Word has length 109 [2019-09-10 04:35:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:20,340 INFO L475 AbstractCegarLoop]: Abstraction has 3264 states and 4615 transitions. [2019-09-10 04:35:20,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4615 transitions. [2019-09-10 04:35:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:20,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:20,343 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] [2019-09-10 04:35:20,343 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1139243427, now seen corresponding path program 1 times [2019-09-10 04:35:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:20,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:20,485 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:35:20,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:20,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:20,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:20,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:20,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:20,488 INFO L87 Difference]: Start difference. First operand 3264 states and 4615 transitions. Second operand 5 states. [2019-09-10 04:35:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:21,057 INFO L93 Difference]: Finished difference Result 6251 states and 8779 transitions. [2019-09-10 04:35:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:21,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:21,092 INFO L225 Difference]: With dead ends: 6251 [2019-09-10 04:35:21,093 INFO L226 Difference]: Without dead ends: 6251 [2019-09-10 04:35:21,093 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:35:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-10 04:35:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2019-09-10 04:35:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2019-09-10 04:35:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8778 transitions. [2019-09-10 04:35:21,406 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8778 transitions. Word has length 109 [2019-09-10 04:35:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:21,406 INFO L475 AbstractCegarLoop]: Abstraction has 6249 states and 8778 transitions. [2019-09-10 04:35:21,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8778 transitions. [2019-09-10 04:35:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:21,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:21,409 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] [2019-09-10 04:35:21,409 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1804548435, now seen corresponding path program 1 times [2019-09-10 04:35:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:21,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:21,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:21,570 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:35:21,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:21,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:21,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:21,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:21,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:21,573 INFO L87 Difference]: Start difference. First operand 6249 states and 8778 transitions. Second operand 5 states. [2019-09-10 04:35:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:22,158 INFO L93 Difference]: Finished difference Result 11978 states and 16694 transitions. [2019-09-10 04:35:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:22,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:22,223 INFO L225 Difference]: With dead ends: 11978 [2019-09-10 04:35:22,223 INFO L226 Difference]: Without dead ends: 11978 [2019-09-10 04:35:22,223 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:35:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2019-09-10 04:35:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11976. [2019-09-10 04:35:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11976 states. [2019-09-10 04:35:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11976 states to 11976 states and 16693 transitions. [2019-09-10 04:35:22,584 INFO L78 Accepts]: Start accepts. Automaton has 11976 states and 16693 transitions. Word has length 109 [2019-09-10 04:35:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:22,585 INFO L475 AbstractCegarLoop]: Abstraction has 11976 states and 16693 transitions. [2019-09-10 04:35:22,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11976 states and 16693 transitions. [2019-09-10 04:35:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:22,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:22,590 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] [2019-09-10 04:35:22,590 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1227473505, now seen corresponding path program 1 times [2019-09-10 04:35:22,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:22,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:22,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:22,905 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:35:22,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:22,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:22,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:22,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:22,907 INFO L87 Difference]: Start difference. First operand 11976 states and 16693 transitions. Second operand 5 states. [2019-09-10 04:35:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:23,536 INFO L93 Difference]: Finished difference Result 22928 states and 31690 transitions. [2019-09-10 04:35:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:23,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:23,658 INFO L225 Difference]: With dead ends: 22928 [2019-09-10 04:35:23,659 INFO L226 Difference]: Without dead ends: 22928 [2019-09-10 04:35:23,659 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:35:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22928 states. [2019-09-10 04:35:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22928 to 22926. [2019-09-10 04:35:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22926 states. [2019-09-10 04:35:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22926 states to 22926 states and 31689 transitions. [2019-09-10 04:35:24,474 INFO L78 Accepts]: Start accepts. Automaton has 22926 states and 31689 transitions. Word has length 109 [2019-09-10 04:35:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:24,474 INFO L475 AbstractCegarLoop]: Abstraction has 22926 states and 31689 transitions. [2019-09-10 04:35:24,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22926 states and 31689 transitions. [2019-09-10 04:35:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:24,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:24,477 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] [2019-09-10 04:35:24,477 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 20035349, now seen corresponding path program 1 times [2019-09-10 04:35:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:24,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:24,589 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:35:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:24,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:24,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:24,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:24,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:24,591 INFO L87 Difference]: Start difference. First operand 22926 states and 31689 transitions. Second operand 5 states. [2019-09-10 04:35:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:25,287 INFO L93 Difference]: Finished difference Result 43784 states and 59990 transitions. [2019-09-10 04:35:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:25,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:25,483 INFO L225 Difference]: With dead ends: 43784 [2019-09-10 04:35:25,483 INFO L226 Difference]: Without dead ends: 43784 [2019-09-10 04:35:25,484 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:35:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43784 states. [2019-09-10 04:35:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43784 to 43782. [2019-09-10 04:35:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43782 states. [2019-09-10 04:35:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43782 states to 43782 states and 59989 transitions. [2019-09-10 04:35:27,321 INFO L78 Accepts]: Start accepts. Automaton has 43782 states and 59989 transitions. Word has length 109 [2019-09-10 04:35:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:27,322 INFO L475 AbstractCegarLoop]: Abstraction has 43782 states and 59989 transitions. [2019-09-10 04:35:27,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43782 states and 59989 transitions. [2019-09-10 04:35:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:27,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:27,324 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] [2019-09-10 04:35:27,324 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1618192801, now seen corresponding path program 1 times [2019-09-10 04:35:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:27,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:27,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:27,424 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:35:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:27,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:27,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:27,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:27,426 INFO L87 Difference]: Start difference. First operand 43782 states and 59989 transitions. Second operand 5 states. [2019-09-10 04:35:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:28,375 INFO L93 Difference]: Finished difference Result 83336 states and 113158 transitions. [2019-09-10 04:35:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:35:28,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:35:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:28,736 INFO L225 Difference]: With dead ends: 83336 [2019-09-10 04:35:28,737 INFO L226 Difference]: Without dead ends: 83336 [2019-09-10 04:35:28,737 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:35:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83336 states. [2019-09-10 04:35:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83336 to 83334. [2019-09-10 04:35:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83334 states. [2019-09-10 04:35:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83334 states to 83334 states and 113157 transitions. [2019-09-10 04:35:32,067 INFO L78 Accepts]: Start accepts. Automaton has 83334 states and 113157 transitions. Word has length 109 [2019-09-10 04:35:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:32,068 INFO L475 AbstractCegarLoop]: Abstraction has 83334 states and 113157 transitions. [2019-09-10 04:35:32,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83334 states and 113157 transitions. [2019-09-10 04:35:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:35:32,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:32,069 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] [2019-09-10 04:35:32,069 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash -422447531, now seen corresponding path program 1 times [2019-09-10 04:35:32,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:32,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:32,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:32,479 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:35:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:35:32,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:32,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:35:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:35:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:35:32,481 INFO L87 Difference]: Start difference. First operand 83334 states and 113157 transitions. Second operand 15 states. [2019-09-10 04:35:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:44,278 INFO L93 Difference]: Finished difference Result 139016 states and 218638 transitions. [2019-09-10 04:35:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:35:44,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-10 04:35:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:44,865 INFO L225 Difference]: With dead ends: 139016 [2019-09-10 04:35:44,865 INFO L226 Difference]: Without dead ends: 139016 [2019-09-10 04:35:44,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1250, Invalid=4450, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:35:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139016 states. [2019-09-10 04:35:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139016 to 83718. [2019-09-10 04:35:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83718 states. [2019-09-10 04:35:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83718 states to 83718 states and 113157 transitions. [2019-09-10 04:35:48,038 INFO L78 Accepts]: Start accepts. Automaton has 83718 states and 113157 transitions. Word has length 109 [2019-09-10 04:35:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:48,038 INFO L475 AbstractCegarLoop]: Abstraction has 83718 states and 113157 transitions. [2019-09-10 04:35:48,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:35:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 83718 states and 113157 transitions. [2019-09-10 04:35:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:35:48,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:48,040 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] [2019-09-10 04:35:48,040 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1388409668, now seen corresponding path program 1 times [2019-09-10 04:35:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:48,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:48,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:48,134 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:35:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:48,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:48,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:48,136 INFO L87 Difference]: Start difference. First operand 83718 states and 113157 transitions. Second operand 5 states. [2019-09-10 04:35:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:48,766 INFO L93 Difference]: Finished difference Result 159454 states and 216860 transitions. [2019-09-10 04:35:48,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:35:48,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 04:35:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:49,215 INFO L225 Difference]: With dead ends: 159454 [2019-09-10 04:35:49,216 INFO L226 Difference]: Without dead ends: 159454 [2019-09-10 04:35:49,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:35:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159454 states. [2019-09-10 04:35:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159454 to 109690. [2019-09-10 04:35:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109690 states. [2019-09-10 04:35:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109690 states to 109690 states and 148090 transitions. [2019-09-10 04:35:52,660 INFO L78 Accepts]: Start accepts. Automaton has 109690 states and 148090 transitions. Word has length 110 [2019-09-10 04:35:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:52,661 INFO L475 AbstractCegarLoop]: Abstraction has 109690 states and 148090 transitions. [2019-09-10 04:35:52,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 109690 states and 148090 transitions. [2019-09-10 04:35:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:35:52,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:52,662 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] [2019-09-10 04:35:52,662 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1259132667, now seen corresponding path program 1 times [2019-09-10 04:35:52,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:52,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:52,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:52,773 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:35:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:35:52,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:52,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:35:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:35:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:35:52,775 INFO L87 Difference]: Start difference. First operand 109690 states and 148090 transitions. Second operand 8 states. [2019-09-10 04:35:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:53,325 INFO L93 Difference]: Finished difference Result 139138 states and 197176 transitions. [2019-09-10 04:35:53,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:35:53,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-10 04:35:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:56,509 INFO L225 Difference]: With dead ends: 139138 [2019-09-10 04:35:56,510 INFO L226 Difference]: Without dead ends: 139138 [2019-09-10 04:35:56,510 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:35:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139138 states. [2019-09-10 04:35:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139138 to 122938. [2019-09-10 04:35:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122938 states. [2019-09-10 04:35:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122938 states to 122938 states and 161562 transitions. [2019-09-10 04:35:59,338 INFO L78 Accepts]: Start accepts. Automaton has 122938 states and 161562 transitions. Word has length 110 [2019-09-10 04:35:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:59,338 INFO L475 AbstractCegarLoop]: Abstraction has 122938 states and 161562 transitions. [2019-09-10 04:35:59,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:35:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 122938 states and 161562 transitions. [2019-09-10 04:35:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:35:59,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:59,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:59,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash 33206831, now seen corresponding path program 1 times [2019-09-10 04:35:59,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:59,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:35:59,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:59,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:35:59,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:35:59,714 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [355], [357], [359], [362], [366], [368], [369], [372], [388], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [465], [467], [469], [470], [473], [475], [478], [480], [481], [484], [487], [492], [495], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:35:59,751 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:35:59,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:35:59,894 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:02,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:36:02,699 INFO L272 AbstractInterpreter]: Visited 133 different actions 1803 times. Merged at 22 different actions 393 times. Widened at 1 different actions 3 times. Performed 21840 root evaluator evaluations with a maximum evaluation depth of 6. Performed 21840 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 89 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:36:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:02,710 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:36:03,370 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 78.03% of their original sizes. [2019-09-10 04:36:03,370 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:36:12,686 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:36:12,686 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:36:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:36:12,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [90] imperfect sequences [17] total 105 [2019-09-10 04:36:12,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:12,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 04:36:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 04:36:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=7319, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 04:36:12,692 INFO L87 Difference]: Start difference. First operand 122938 states and 161562 transitions. Second operand 90 states. [2019-09-10 04:38:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:14,492 INFO L93 Difference]: Finished difference Result 139611 states and 197074 transitions. [2019-09-10 04:38:14,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-09-10 04:38:14,493 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 169 [2019-09-10 04:38:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:15,469 INFO L225 Difference]: With dead ends: 139611 [2019-09-10 04:38:15,469 INFO L226 Difference]: Without dead ends: 139611 [2019-09-10 04:38:15,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29775 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=5957, Invalid=77853, Unknown=0, NotChecked=0, Total=83810 [2019-09-10 04:38:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139611 states. [2019-09-10 04:38:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139611 to 120334. [2019-09-10 04:38:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120334 states. [2019-09-10 04:38:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120334 states to 120334 states and 157477 transitions. [2019-09-10 04:38:20,655 INFO L78 Accepts]: Start accepts. Automaton has 120334 states and 157477 transitions. Word has length 169 [2019-09-10 04:38:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:20,656 INFO L475 AbstractCegarLoop]: Abstraction has 120334 states and 157477 transitions. [2019-09-10 04:38:20,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 04:38:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 120334 states and 157477 transitions. [2019-09-10 04:38:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:38:20,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:20,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:20,705 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 582829849, now seen corresponding path program 1 times [2019-09-10 04:38:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:20,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:38:21,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:21,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:38:21,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:38:21,036 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [355], [357], [359], [362], [366], [368], [369], [372], [375], [380], [383], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [463], [467], [469], [470], [473], [475], [478], [480], [481], [484], [500], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:38:21,050 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:38:21,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:38:21,075 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:38:22,965 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:38:22,966 INFO L272 AbstractInterpreter]: Visited 134 different actions 2133 times. Merged at 24 different actions 507 times. Widened at 1 different actions 3 times. Performed 26214 root evaluator evaluations with a maximum evaluation depth of 6. Performed 26214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 128 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:38:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:22,966 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:38:23,297 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.99% of their original sizes. [2019-09-10 04:38:23,297 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:38:31,625 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:38:31,625 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:38:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:38:31,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [93] imperfect sequences [16] total 107 [2019-09-10 04:38:31,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:31,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 04:38:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 04:38:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=7847, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 04:38:31,629 INFO L87 Difference]: Start difference. First operand 120334 states and 157477 transitions. Second operand 93 states. [2019-09-10 04:46:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:46:57,054 INFO L93 Difference]: Finished difference Result 169310 states and 239767 transitions. [2019-09-10 04:46:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 509 states. [2019-09-10 04:46:57,054 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 169 [2019-09-10 04:46:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:46:57,623 INFO L225 Difference]: With dead ends: 169310 [2019-09-10 04:46:57,623 INFO L226 Difference]: Without dead ends: 169310 [2019-09-10 04:46:57,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133461 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=21443, Invalid=300613, Unknown=0, NotChecked=0, Total=322056 [2019-09-10 04:46:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169310 states. [2019-09-10 04:47:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169310 to 141871. [2019-09-10 04:47:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141871 states. [2019-09-10 04:47:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141871 states to 141871 states and 185714 transitions. [2019-09-10 04:47:01,523 INFO L78 Accepts]: Start accepts. Automaton has 141871 states and 185714 transitions. Word has length 169 [2019-09-10 04:47:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:01,524 INFO L475 AbstractCegarLoop]: Abstraction has 141871 states and 185714 transitions. [2019-09-10 04:47:01,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-10 04:47:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 141871 states and 185714 transitions. [2019-09-10 04:47:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:47:01,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:01,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,557 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1116932941, now seen corresponding path program 1 times [2019-09-10 04:47:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:47:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:47:01,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:47:01,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:47:01,889 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [342], [347], [350], [357], [359], [362], [366], [368], [369], [372], [388], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [463], [467], [469], [470], [473], [475], [478], [480], [481], [484], [500], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:47:01,894 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:47:01,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:47:01,917 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:47:03,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:47:03,206 INFO L272 AbstractInterpreter]: Visited 134 different actions 2123 times. Merged at 24 different actions 506 times. Widened at 1 different actions 3 times. Performed 25293 root evaluator evaluations with a maximum evaluation depth of 6. Performed 25293 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 131 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:47:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:03,207 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:47:03,436 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.95% of their original sizes. [2019-09-10 04:47:03,436 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:47:14,746 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:47:14,746 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:47:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:47:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [94] imperfect sequences [16] total 108 [2019-09-10 04:47:14,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:14,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 04:47:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 04:47:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=8059, Unknown=0, NotChecked=0, Total=8742 [2019-09-10 04:47:14,749 INFO L87 Difference]: Start difference. First operand 141871 states and 185714 transitions. Second operand 94 states.