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-var-start-time.6.1.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:20:53,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:20:53,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:20:53,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:20:53,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:20:53,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:20:53,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:20:53,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:20:53,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:20:53,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:20:53,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:20:53,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:20:53,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:20:53,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:20:53,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:20:53,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:20:53,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:20:53,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:20:53,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:20:53,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:20:53,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:20:53,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:20:53,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:20:53,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:20:53,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:20:53,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:20:53,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:20:53,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:20:53,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:20:53,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:20:53,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:20:53,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:20:53,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:20:53,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:20:53,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:20:53,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:20:53,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:20:53,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:20:53,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:20:53,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:20:53,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:20:53,892 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:20:53,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:20:53,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:20:53,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:20:53,920 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:20:53,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:20:53,920 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:20:53,921 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:20:53,921 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:20:53,921 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:20:53,921 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:20:53,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:20:53,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:20:53,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:20:53,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:20:53,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:20:53,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:20:53,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:20:53,924 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:20:53,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:20:53,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:20:53,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:20:53,924 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:20:53,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:20:53,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:20:53,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:20:53,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:20:53,925 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:20:53,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:20:53,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:20:53,926 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:20:53,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:20:53,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:20:53,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:20:53,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:20:53,971 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:20:53,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:20:54,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bbeecfc/6c810868b570497db8f60a9811927e61/FLAGa733997ac [2019-09-10 04:20:54,542 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:20:54,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:20:54,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bbeecfc/6c810868b570497db8f60a9811927e61/FLAGa733997ac [2019-09-10 04:20:54,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bbeecfc/6c810868b570497db8f60a9811927e61 [2019-09-10 04:20:54,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:20:54,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:20:54,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:20:54,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:20:54,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:20:54,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:20:54" (1/1) ... [2019-09-10 04:20:54,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa32137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:54, skipping insertion in model container [2019-09-10 04:20:54,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:20:54" (1/1) ... [2019-09-10 04:20:54,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:20:54,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:20:55,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:20:55,292 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:20:55,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:20:55,374 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:20:55,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55 WrapperNode [2019-09-10 04:20:55,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:20:55,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:20:55,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:20:55,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:20:55,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (1/1) ... [2019-09-10 04:20:55,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:20:55,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:20:55,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:20:55,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:20:55,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (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:20:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:20:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:20:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:20:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:20:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:20:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:20:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:20:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:20:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:20:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:20:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:20:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:20:56,291 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:20:56,291 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:20:56,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:20:56 BoogieIcfgContainer [2019-09-10 04:20:56,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:20:56,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:20:56,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:20:56,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:20:56,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:20:54" (1/3) ... [2019-09-10 04:20:56,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db02d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:20:56, skipping insertion in model container [2019-09-10 04:20:56,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:55" (2/3) ... [2019-09-10 04:20:56,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db02d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:20:56, skipping insertion in model container [2019-09-10 04:20:56,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:20:56" (3/3) ... [2019-09-10 04:20:56,300 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-09-10 04:20:56,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:20:56,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:20:56,334 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:20:56,359 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:20:56,359 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:20:56,359 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:20:56,360 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:20:56,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:20:56,360 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:20:56,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:20:56,360 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:20:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-09-10 04:20:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 04:20:56,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:56,397 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:20:56,399 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1218527924, now seen corresponding path program 1 times [2019-09-10 04:20:56,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:56,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:56,794 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:20:56,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:20:56,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:20:56,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:56,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:20:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:20:56,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:20:56,823 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 5 states. [2019-09-10 04:20:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:20:56,979 INFO L93 Difference]: Finished difference Result 183 states and 280 transitions. [2019-09-10 04:20:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:20:56,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 04:20:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:20:57,005 INFO L225 Difference]: With dead ends: 183 [2019-09-10 04:20:57,006 INFO L226 Difference]: Without dead ends: 174 [2019-09-10 04:20:57,009 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:20:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-10 04:20:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-09-10 04:20:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-10 04:20:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2019-09-10 04:20:57,093 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 68 [2019-09-10 04:20:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:20:57,093 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2019-09-10 04:20:57,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:20:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2019-09-10 04:20:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 04:20:57,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:57,105 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] [2019-09-10 04:20:57,106 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:57,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1659078954, now seen corresponding path program 1 times [2019-09-10 04:20:57,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:57,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:57,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:57,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:57,649 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:20:57,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:20:57,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:20:57,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:57,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:20:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:20:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:20:57,654 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand 15 states. [2019-09-10 04:21:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:06,426 INFO L93 Difference]: Finished difference Result 1745 states and 2683 transitions. [2019-09-10 04:21:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 04:21:06,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-10 04:21:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:06,450 INFO L225 Difference]: With dead ends: 1745 [2019-09-10 04:21:06,450 INFO L226 Difference]: Without dead ends: 1745 [2019-09-10 04:21:06,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1105, Invalid=3865, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 04:21:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-09-10 04:21:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1162. [2019-09-10 04:21:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-10 04:21:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1713 transitions. [2019-09-10 04:21:06,612 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1713 transitions. Word has length 108 [2019-09-10 04:21:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:06,613 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1713 transitions. [2019-09-10 04:21:06,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:21:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1713 transitions. [2019-09-10 04:21:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:21:06,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:06,617 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:21:06,617 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1362325190, now seen corresponding path program 1 times [2019-09-10 04:21:06,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:06,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:21:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:21:06,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:06,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:21:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:21:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:21:06,814 INFO L87 Difference]: Start difference. First operand 1162 states and 1713 transitions. Second operand 8 states. [2019-09-10 04:21:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:06,922 INFO L93 Difference]: Finished difference Result 1351 states and 2018 transitions. [2019-09-10 04:21:06,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:21:06,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-09-10 04:21:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:06,933 INFO L225 Difference]: With dead ends: 1351 [2019-09-10 04:21:06,933 INFO L226 Difference]: Without dead ends: 1351 [2019-09-10 04:21:06,933 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:21:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-10 04:21:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1243. [2019-09-10 04:21:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-10 04:21:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1794 transitions. [2019-09-10 04:21:06,999 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1794 transitions. Word has length 109 [2019-09-10 04:21:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:07,000 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1794 transitions. [2019-09-10 04:21:07,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:21:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1794 transitions. [2019-09-10 04:21:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:21:07,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:07,003 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:21:07,003 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1962088830, now seen corresponding path program 1 times [2019-09-10 04:21:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:07,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:07,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:07,190 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:21:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:07,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:21:07,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:07,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:21:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:21:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:21:07,193 INFO L87 Difference]: Start difference. First operand 1243 states and 1794 transitions. Second operand 7 states. [2019-09-10 04:21:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:08,148 INFO L93 Difference]: Finished difference Result 4507 states and 6559 transitions. [2019-09-10 04:21:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:21:08,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2019-09-10 04:21:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:08,174 INFO L225 Difference]: With dead ends: 4507 [2019-09-10 04:21:08,174 INFO L226 Difference]: Without dead ends: 4507 [2019-09-10 04:21:08,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-10 04:21:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4501. [2019-09-10 04:21:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-10 04:21:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6556 transitions. [2019-09-10 04:21:08,332 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6556 transitions. Word has length 110 [2019-09-10 04:21:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:08,333 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 6556 transitions. [2019-09-10 04:21:08,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:21:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6556 transitions. [2019-09-10 04:21:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:08,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:08,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:08,338 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1490326786, now seen corresponding path program 1 times [2019-09-10 04:21:08,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:08,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:08,529 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:21:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:08,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:08,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:08,532 INFO L87 Difference]: Start difference. First operand 4501 states and 6556 transitions. Second operand 9 states. [2019-09-10 04:21:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:09,514 INFO L93 Difference]: Finished difference Result 6732 states and 9838 transitions. [2019-09-10 04:21:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:09,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:09,552 INFO L225 Difference]: With dead ends: 6732 [2019-09-10 04:21:09,553 INFO L226 Difference]: Without dead ends: 6732 [2019-09-10 04:21:09,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2019-09-10 04:21:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 4656. [2019-09-10 04:21:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2019-09-10 04:21:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 6777 transitions. [2019-09-10 04:21:09,747 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 6777 transitions. Word has length 111 [2019-09-10 04:21:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:09,748 INFO L475 AbstractCegarLoop]: Abstraction has 4656 states and 6777 transitions. [2019-09-10 04:21:09,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 6777 transitions. [2019-09-10 04:21:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:09,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:09,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:09,752 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash -630466114, now seen corresponding path program 1 times [2019-09-10 04:21:09,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:09,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:09,923 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:21:09,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:09,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:09,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:09,926 INFO L87 Difference]: Start difference. First operand 4656 states and 6777 transitions. Second operand 9 states. [2019-09-10 04:21:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:10,973 INFO L93 Difference]: Finished difference Result 6244 states and 9057 transitions. [2019-09-10 04:21:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:10,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:11,005 INFO L225 Difference]: With dead ends: 6244 [2019-09-10 04:21:11,005 INFO L226 Difference]: Without dead ends: 6223 [2019-09-10 04:21:11,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2019-09-10 04:21:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 4743. [2019-09-10 04:21:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4743 states. [2019-09-10 04:21:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4743 states to 4743 states and 6899 transitions. [2019-09-10 04:21:11,162 INFO L78 Accepts]: Start accepts. Automaton has 4743 states and 6899 transitions. Word has length 111 [2019-09-10 04:21:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:11,163 INFO L475 AbstractCegarLoop]: Abstraction has 4743 states and 6899 transitions. [2019-09-10 04:21:11,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 6899 transitions. [2019-09-10 04:21:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:11,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:11,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:11,166 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash 482955028, now seen corresponding path program 1 times [2019-09-10 04:21:11,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:11,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:11,310 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:21:11,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:11,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:11,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:11,312 INFO L87 Difference]: Start difference. First operand 4743 states and 6899 transitions. Second operand 9 states. [2019-09-10 04:21:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:12,416 INFO L93 Difference]: Finished difference Result 5700 states and 8221 transitions. [2019-09-10 04:21:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:12,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:12,446 INFO L225 Difference]: With dead ends: 5700 [2019-09-10 04:21:12,446 INFO L226 Difference]: Without dead ends: 5679 [2019-09-10 04:21:12,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-09-10 04:21:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 4828. [2019-09-10 04:21:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4828 states. [2019-09-10 04:21:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 7019 transitions. [2019-09-10 04:21:12,572 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 7019 transitions. Word has length 111 [2019-09-10 04:21:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:12,572 INFO L475 AbstractCegarLoop]: Abstraction has 4828 states and 7019 transitions. [2019-09-10 04:21:12,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 7019 transitions. [2019-09-10 04:21:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:12,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:12,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:12,575 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -377390433, now seen corresponding path program 1 times [2019-09-10 04:21:12,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:12,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:12,680 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:21:12,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:12,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:12,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:12,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:12,683 INFO L87 Difference]: Start difference. First operand 4828 states and 7019 transitions. Second operand 9 states. [2019-09-10 04:21:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:13,785 INFO L93 Difference]: Finished difference Result 5154 states and 7383 transitions. [2019-09-10 04:21:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:13,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:13,829 INFO L225 Difference]: With dead ends: 5154 [2019-09-10 04:21:13,829 INFO L226 Difference]: Without dead ends: 5133 [2019-09-10 04:21:13,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-09-10 04:21:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4913. [2019-09-10 04:21:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4913 states. [2019-09-10 04:21:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 7139 transitions. [2019-09-10 04:21:13,972 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 7139 transitions. Word has length 111 [2019-09-10 04:21:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:13,973 INFO L475 AbstractCegarLoop]: Abstraction has 4913 states and 7139 transitions. [2019-09-10 04:21:13,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 7139 transitions. [2019-09-10 04:21:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:13,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:13,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:13,976 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 308453418, now seen corresponding path program 1 times [2019-09-10 04:21:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:13,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:13,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:13,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:14,107 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:21:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:14,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:14,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:14,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:14,109 INFO L87 Difference]: Start difference. First operand 4913 states and 7139 transitions. Second operand 9 states. [2019-09-10 04:21:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:15,058 INFO L93 Difference]: Finished difference Result 7529 states and 11016 transitions. [2019-09-10 04:21:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:15,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:15,092 INFO L225 Difference]: With dead ends: 7529 [2019-09-10 04:21:15,092 INFO L226 Difference]: Without dead ends: 7514 [2019-09-10 04:21:15,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2019-09-10 04:21:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 5559. [2019-09-10 04:21:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-09-10 04:21:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 8127 transitions. [2019-09-10 04:21:15,276 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 8127 transitions. Word has length 111 [2019-09-10 04:21:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:15,276 INFO L475 AbstractCegarLoop]: Abstraction has 5559 states and 8127 transitions. [2019-09-10 04:21:15,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 8127 transitions. [2019-09-10 04:21:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:21:15,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:15,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:15,279 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1893422644, now seen corresponding path program 1 times [2019-09-10 04:21:15,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:15,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:15,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:15,434 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:21:15,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:15,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:15,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:15,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:15,436 INFO L87 Difference]: Start difference. First operand 5559 states and 8127 transitions. Second operand 9 states. [2019-09-10 04:21:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:16,380 INFO L93 Difference]: Finished difference Result 7595 states and 11219 transitions. [2019-09-10 04:21:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:16,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:21:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:16,404 INFO L225 Difference]: With dead ends: 7595 [2019-09-10 04:21:16,405 INFO L226 Difference]: Without dead ends: 7583 [2019-09-10 04:21:16,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-09-10 04:21:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5186. [2019-09-10 04:21:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2019-09-10 04:21:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7579 transitions. [2019-09-10 04:21:16,527 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7579 transitions. Word has length 111 [2019-09-10 04:21:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:16,528 INFO L475 AbstractCegarLoop]: Abstraction has 5186 states and 7579 transitions. [2019-09-10 04:21:16,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7579 transitions. [2019-09-10 04:21:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 04:21:16,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:16,534 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:16,535 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1557071076, now seen corresponding path program 1 times [2019-09-10 04:21:16,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:16,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 04:21:16,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:16,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:16,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 04:21:16,670 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [247], [248], [249], [251], [260], [267], [269], [271], [277], [280], [283], [285], [290], [295], [296], [297], [300], [322], [324], [354], [355], [358], [380], [382], [412], [413], [416], [438], [440], [470], [471], [474], [496], [498], [528], [529], [530], [531], [534], [556], [558], [588], [589], [592], [594], [597], [599], [600], [603], [625], [627], [657], [661], [662], [663], [664], [665], [666], [667], [668], [669], [670], [671], [672], [673], [674], [675], [676], [677], [678], [679], [680], [681] [2019-09-10 04:21:16,743 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:16,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:16,942 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:18,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:18,131 INFO L272 AbstractInterpreter]: Visited 115 different actions 529 times. Merged at 15 different actions 99 times. Widened at 1 different actions 2 times. Performed 7259 root evaluator evaluations with a maximum evaluation depth of 8. Performed 7259 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 7 fixpoints after 2 different actions. Largest state had 152 variables. [2019-09-10 04:21:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:18,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:18,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:18,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:21:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:18,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:18,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-10 04:21:18,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 04:21:18,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:18,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:21:18,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:18,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:18,698 INFO L87 Difference]: Start difference. First operand 5186 states and 7579 transitions. Second operand 5 states. [2019-09-10 04:21:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:19,448 INFO L93 Difference]: Finished difference Result 7215 states and 10430 transitions. [2019-09-10 04:21:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:19,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-10 04:21:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:19,480 INFO L225 Difference]: With dead ends: 7215 [2019-09-10 04:21:19,480 INFO L226 Difference]: Without dead ends: 7215 [2019-09-10 04:21:19,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:21:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7215 states. [2019-09-10 04:21:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7215 to 6852. [2019-09-10 04:21:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2019-09-10 04:21:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 9885 transitions. [2019-09-10 04:21:19,712 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 9885 transitions. Word has length 168 [2019-09-10 04:21:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:19,712 INFO L475 AbstractCegarLoop]: Abstraction has 6852 states and 9885 transitions. [2019-09-10 04:21:19,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 9885 transitions. [2019-09-10 04:21:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 04:21:19,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:19,720 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,721 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 17895358, now seen corresponding path program 1 times [2019-09-10 04:21:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:19,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:19,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 04:21:19,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:19,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:19,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-10 04:21:19,866 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [247], [248], [249], [251], [260], [267], [269], [271], [277], [280], [283], [293], [295], [296], [297], [300], [322], [324], [326], [338], [350], [352], [354], [355], [358], [380], [382], [412], [413], [416], [438], [440], [470], [471], [474], [496], [498], [528], [529], [530], [531], [534], [537], [540], [545], [548], [556], [558], [588], [589], [592], [594], [597], [599], [600], [603], [625], [627], [657], [661], [662], [663], [664], [665], [666], [667], [668], [669], [670], [671], [672], [673], [674], [675], [676], [677], [678], [679], [680], [681] [2019-09-10 04:21:19,875 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:19,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:19,905 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:21,022 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:21:21,023 INFO L272 AbstractInterpreter]: Visited 118 different actions 642 times. Merged at 14 different actions 108 times. Widened at 1 different actions 2 times. Performed 10051 root evaluator evaluations with a maximum evaluation depth of 7. Performed 10051 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 8 fixpoints after 3 different actions. Largest state had 152 variables. [2019-09-10 04:21:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:21,023 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:21:21,585 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 78.92% of their original sizes. [2019-09-10 04:21:21,585 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:21:28,113 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-10 04:21:28,113 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:21:28,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:21:28,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [90] imperfect sequences [5] total 93 [2019-09-10 04:21:28,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:28,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 04:21:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 04:21:28,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=7302, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 04:21:28,120 INFO L87 Difference]: Start difference. First operand 6852 states and 9885 transitions. Second operand 90 states. [2019-09-10 04:26:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:26:14,994 INFO L93 Difference]: Finished difference Result 12311 states and 18138 transitions. [2019-09-10 04:26:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 705 states. [2019-09-10 04:26:14,994 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 170 [2019-09-10 04:26:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:26:15,029 INFO L225 Difference]: With dead ends: 12311 [2019-09-10 04:26:15,029 INFO L226 Difference]: Without dead ends: 12311 [2019-09-10 04:26:15,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 753 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249553 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=36259, Invalid=533011, Unknown=0, NotChecked=0, Total=569270 [2019-09-10 04:26:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12311 states. [2019-09-10 04:26:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12311 to 8867. [2019-09-10 04:26:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8867 states. [2019-09-10 04:26:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 12616 transitions. [2019-09-10 04:26:15,294 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 12616 transitions. Word has length 170 [2019-09-10 04:26:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:26:15,295 INFO L475 AbstractCegarLoop]: Abstraction has 8867 states and 12616 transitions. [2019-09-10 04:26:15,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 04:26:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 12616 transitions. [2019-09-10 04:26:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 04:26:15,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:26:15,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:15,302 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:26:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:26:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2017074159, now seen corresponding path program 1 times [2019-09-10 04:26:15,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:26:15,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:26:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:26:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:26:15,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:26:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:26:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 04:26:15,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:26:15,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:26:15,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2019-09-10 04:26:15,486 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [247], [248], [249], [251], [260], [267], [269], [271], [277], [280], [283], [293], [295], [296], [297], [300], [322], [324], [326], [329], [332], [336], [352], [354], [355], [358], [380], [382], [412], [413], [416], [438], [440], [470], [471], [474], [496], [498], [528], [529], [530], [531], [534], [537], [540], [545], [548], [556], [558], [588], [589], [592], [594], [597], [599], [600], [603], [625], [627], [657], [661], [662], [663], [664], [665], [666], [667], [668], [669], [670], [671], [672], [673], [674], [675], [676], [677], [678], [679], [680], [681] [2019-09-10 04:26:15,490 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:26:15,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:26:15,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:26:16,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:26:16,684 INFO L272 AbstractInterpreter]: Visited 119 different actions 649 times. Merged at 14 different actions 108 times. Widened at 1 different actions 2 times. Performed 9526 root evaluator evaluations with a maximum evaluation depth of 7. Performed 9526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 8 fixpoints after 3 different actions. Largest state had 152 variables. [2019-09-10 04:26:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:26:16,684 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:26:16,979 INFO L227 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 79.08% of their original sizes. [2019-09-10 04:26:16,980 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:26:23,873 INFO L420 sIntCurrentIteration]: We unified 170 AI predicates to 170 [2019-09-10 04:26:23,873 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:26:23,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:26:23,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [93] imperfect sequences [5] total 96 [2019-09-10 04:26:23,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:26:23,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 04:26:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 04:26:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=7814, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 04:26:23,876 INFO L87 Difference]: Start difference. First operand 8867 states and 12616 transitions. Second operand 93 states.